login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A058974 a(n) = 0 if n = 1 or a prime, otherwise a(n) = s + a(s) iterated until no change occurs, where s (A008472) is sum of distinct primes dividing n. 1
0, 0, 0, 2, 0, 5, 0, 2, 3, 7, 0, 5, 0, 12, 10, 2, 0, 5, 0, 7, 17, 13, 0, 5, 5, 25, 3, 12, 0, 17, 0, 2, 26, 19, 17, 5, 0, 38, 18, 7, 0, 17, 0, 13, 10, 30, 0, 5, 7, 7, 27, 25, 0, 5, 18, 12, 35, 31, 0, 17, 0, 59, 17, 2, 23, 18, 0, 19, 51, 26, 0, 5, 0, 57, 10, 38, 23 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

REFERENCES

E. N. Gilbert, An interesting property of 38, unpublished, circa 1992. Shows that 38 is the only solution of a(n) = n.

MAPLE

f := proc(n) option remember; local i, j, k, t1, t2; if n = 1 or isprime(n) then 0 else A008472(n) + f(A008472(n)); fi; end;

MATHEMATICA

f[n_Integer] := If[n == 1 || PrimeQ[n], 0, Plus @@ First[ Transpose[ FactorInteger[n]]]]; Table[Plus @@ Drop[ FixedPointList[f, n], 1], {n, 1, 80}]

CROSSREFS

Cf. A008472.

Sequence in context: A071090 A105221 A061376 * A019962 A086131 A104755

Adjacent sequences:  A058971 A058972 A058973 * A058975 A058976 A058977

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jan 15 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 23:53 EST 2012. Contains 205689 sequences.