A029914 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A029914

Start with n; repeatedly sum squares of prime factors (counted with multiplicity), until reach a prime p, then set a(n) = p; if reach a fixed point q, set a(n) = q; set a(n) = 0 if no limit exists.

17, 59, 17, 31, 13

(list; graph; refs; listen; history; text; internal format)

OFFSET

2,1

LINKS

Table of n, a(n) for n=2..6.

EXAMPLE

2 -> 2^2 = 4 -> 2^2 + 2^2 = 8 -> 2^2 + 2^2 + 2^12 = 12 -> 2^2 + 2^2 + 3^2 = 17, prime, so stop; a(2)=17.

CROSSREFS

Cf. A029913.

Sequence in context: A146046 A048508 A020879 * A058319 A095089 A106922

Adjacent sequences: A029911 A029912 A029913 * A029915 A029916 A029917