|
|
A270653
|
|
Integers k such that A003266(k) is divisible by k.
|
|
3
|
|
|
1, 5, 6, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Note that this sequence is not the complement of A000057.
See A230359 for the prime terms of this sequence.
|
|
LINKS
|
|
|
EXAMPLE
|
11 is a term because 1*1*2*3*5*8*13*21*34*55*89 is divisible by 11.
|
|
MATHEMATICA
|
Select[Range@ 80, Divisible[Fibonorial@ #, #] &] (* Version 10, or *) Select[Range@ 80, Divisible[Product[Fibonacci@ k, {k, #}], #] &] (* Michael De Vlieger, Mar 23 2016 *)
|
|
PROG
|
(PARI) t(n) = prod(k=1, n, Mod(fibonacci(k), n));
for(n=1, 1e2, if(lift(t(n)) == 0, print1(n, ", ")));
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|