|
|
A115568
|
|
Maximal Fibonacci exponent in prime factorization of n, or 1 if there is no Fibonacci exponent.
|
|
3
|
|
|
1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 3, 2, 1, 3, 2, 1, 1, 1, 5, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 2, 1, 1, 1, 2, 2, 1, 2, 1, 3, 1, 3, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 2, 1, 2, 1, 1, 1, 5, 1, 2, 2, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
LINKS
|
|
|
MATHEMATICA
|
Module[{fibs=Fibonacci[Range[10]]}, Table[Max[Select[FactorInteger[n][[All, 2]], MemberQ[fibs, #]&]]/.(-\[Infinity]->1), {n, 100}]] (* Harvey P. Dale, Apr 08 2022 *)
|
|
PROG
|
(PARI)
A115568(n) = { my(exps=factorint(n)[, 2], expswith1 = vector(1+length(exps), i, if(1==i, i, exps[i-1]))); vecmax(apply(e -> (A010056(e)*e), expswith1)); }; \\ Antti Karttunen, Jul 23 2017
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|