OFFSET
1,3
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..550
MATHEMATICA
ps[n_] := Sort[Last /@ FactorInteger[n]]; g[n_] := Module[{cy = CoefficientList[ Cyclotomic[n, x], x]}, Total[Times @@@ Thread[{Fibonacci[Range[0, Length[cy] - 1]], cy}]]]; f[n_] := Block[{c = ps[g[n]]}, lng = Length@ c; Times @@ (Reverse[ Prime[ Range[ lng]]]^c)]; f[6] = 0; f[1] = f[2] = f[4] = f[10] = 1; Array[f, 70] (* Robert G. Wilson v, Nov 19 2016 *)
Table[Times @@ MapIndexed[(Prime@ First@ #2)^#1 &, #] &@ If[Length@ # == 1 && #[[1, 1]] == 1, {0}, Reverse@ Sort@ #[[All, -1]]] &@ FactorInteger[
Total[Times @@@ Thread[{Fibonacci[Range[0, Length@ # - 1]], #}]] &@ CoefficientList[Cyclotomic[n, x], x] + Boole[n == 0]], {n, 120}] (* Michael De Vlieger, Nov 21 2016, after Harvey P. Dale at A051258 *)
PROG
(PARI)
A051258(n) = my(P=polcyclo(n)); sum(i=1, poldegree(P), polcoeff(P, i)*fibonacci(i)); \\ From Charles R Greathouse IV, Jan 05 2013
A046523(n) = my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]) \\ From Charles R Greathouse IV, Aug 17 2011
for(n=1, 550, write("b278158.txt", n, " ", A278158(n)));
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Nov 18 2016
STATUS
approved