|
|
|
|
2, 2, 2, 10, 10, 10, 50, 10, 10, 250, 250, 50, 250, 250, 50, 110, 110, 250, 6250, 1250, 1250, 31250, 6250, 550, 2750, 6250, 6250, 13750, 2750, 2750, 6050, 110, 110, 30250, 68750, 13750, 343750, 781250, 156250, 151250, 151250, 781250, 19531250, 1718750, 343750, 8593750, 756250, 6050, 30250, 756250, 1718750, 3781250, 3781250, 8593750, 18906250, 151250
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
LINKS
|
|
|
FORMULA
|
Other identities. For all n >= 0:
|
|
MATHEMATICA
|
a[n_] := a[n] = Which[n < 2, n + 1, EvenQ@ n, Times @@ Map[#1^#2 & @@ # &, FactorInteger[#] /. {p_, e_} /; e > 0 :> {Prime[PrimePi@ p + 1], e}] - Boole[# == 1] &@ a[n/2], True, a[#] a[# + 1] &[(n - 1)/2]]; Table[Times @@ (FactorInteger[#] /. {p_, e_} /; e > 0 :> (p^Mod[PrimePi@ p, 2])^e) &@ a[2 n + 1], {n, 0, 55}] (* Michael De Vlieger, Apr 05 2017 *)
|
|
PROG
|
(Scheme)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|