|
|
A346080
|
|
Shadow transform of Fibonacci numbers.
|
|
0
|
|
|
0, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 2, 2, 2, 1, 3, 1, 1, 2, 1, 2, 1, 2, 3, 1, 2, 2, 2, 4, 1, 3, 2, 3, 2, 2, 3, 2, 1, 2, 1, 2, 3, 4, 1, 1, 2, 2, 2, 2, 6, 3, 2, 2, 2, 1, 5, 3, 3, 2, 2, 2, 1, 4, 3, 1, 2, 6, 2, 2, 1, 5, 2, 1, 2, 2, 1, 2, 1, 4, 2, 1, 4, 3, 9, 2, 2, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,9
|
|
LINKS
|
|
|
MAPLE
|
a:= n-> add(`if`(modp(combinat[fibonacci](j), n)=0, 1, 0), j=0..n-1):
|
|
MATHEMATICA
|
a[n_] := Sum[Boole @ Divisible[Fibonacci[i], n], {i, 0, n - 1}]; Array[a, 100, 0] (* Amiram Eldar, Jul 13 2021 *)
|
|
PROG
|
(Python)
from sympy import fibonacci
def a(n): return n - sum(fibonacci(k)%n != 0 for k in range(n))
(PARI) a(n) = n - sum(k=0, n-1, sign(fibonacci(k)% n)); \\ Michel Marcus, Jul 04 2021
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|