login
A116919
a(0)=1. a(n) = A006530(a(n-1)) + n.
2
1, 2, 4, 5, 9, 8, 8, 9, 11, 20, 15, 16, 14, 20, 19, 34, 33, 28, 25, 24, 23, 44, 33, 34, 41, 66, 37, 64, 30, 34, 47, 78, 45, 38, 53, 88, 47, 84, 45, 44, 51, 58, 71, 114, 63, 52, 59, 106, 101, 150, 55, 62, 83, 136, 71, 126, 63, 64, 60, 64, 62
OFFSET
0,2
LINKS
MAPLE
gpf:= proc(n) max(numtheory:-factorset(n)) end proc:
gpf(1):= 1:
A:= Array(0..100): A[0]:= 1:
for n from 1 to 100 do A[n]:= gpf(A[n-1])+n od:
convert(A, list); # Robert Israel, Nov 26 2020
MATHEMATICA
a={1, 2, 4}; For[n=3, n<=60, n++, b=n+FactorInteger[a[[n]]][[ -1, 1]]; AppendTo[a, b]]; a (* Stefan Steinerberger, May 18 2007 *)
CROSSREFS
Cf. A006530.
Sequence in context: A011341 A116477 A116920 * A270429 A359878 A270097
KEYWORD
nonn,look
AUTHOR
Leroy Quet, Feb 26 2006
EXTENSIONS
More terms from Stefan Steinerberger, May 18 2007
STATUS
approved