|
|
A116920
|
|
a(0)=1. a(n) = A020639(a(n-1)) + n.
|
|
1
|
|
|
1, 2, 4, 5, 9, 8, 8, 9, 11, 20, 12, 13, 25, 18, 16, 17, 33, 20, 20, 21, 23, 44, 24, 25, 29, 54, 28, 29, 57, 32, 32, 33, 35, 38, 36, 37, 73, 110, 40, 41, 81, 44, 44, 45, 47, 92, 48, 49, 55, 54, 52, 53, 105, 56, 56, 57, 59, 116, 60, 61, 121, 72, 64, 65, 69, 68, 68, 69, 71, 140, 72
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
|
|
MAPLE
|
lpf:= proc(n) min(numtheory:-factorset(n)) end proc: lpf(1):= 1:
A:= Array(0..100): A[0]:= 1:
for n from 1 to 100 do A[n]:= lpf(A[n-1])+n od:
|
|
MATHEMATICA
|
a[0] := 1; a[1] := 2; a[n_] := FactorInteger[a[n - 1]][[1]][[1]] + n; Table[a[n], {n, 0, 80}] (* Stefan Steinerberger, Mar 27 2006 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|