|
|
|
|
1, 3, 9, 3, 9, 27, 9, 21, 63, 27, 81, 189, 63, 189, 441, 21, 63, 1323, 567, 1323, 3969, 1701, 3969, 1323, 441, 9261, 27783, 1323, 3087, 9261, 441, 273, 819, 1323, 27783, 64827, 27783, 583443, 1361367, 9261, 27783, 4084101, 1750329, 583443, 1361367, 583443, 194481, 17199, 5733, 453789, 9529569, 453789, 1361367, 28588707, 1361367, 120393, 280917, 453789, 1361367
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
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 + 1, 2])^e) &@ a[2 n + 1], {n, 0, 58}] (* Michael De Vlieger, Apr 05 2017 *)
|
|
PROG
|
(Scheme)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|