|
|
A300004
|
|
First differences of the list A292794 of numbers not congruent to F(k) modulo F(k+1) for any k > 1, where F are the Fibonacci numbers A000045.
|
|
3
|
|
|
4, 2, 4, 2, 4, 6, 2, 6, 6, 4, 2, 4, 6, 2, 10, 2, 4, 2, 10, 2, 6, 4, 2, 4, 2, 4, 8, 6, 4, 2, 4, 2, 4, 6, 8, 4, 2, 6, 4, 6, 2, 6, 4, 2, 6, 4, 8, 6, 4, 6, 2, 4, 6, 2, 6, 6, 4, 2, 4, 6, 2, 6, 4, 2, 4, 2, 10, 8, 4, 2, 4, 2, 4, 8, 6, 4, 2, 4, 2, 10, 2, 6, 6, 10, 6, 2, 6, 4, 2, 4, 2, 4, 8, 6, 6, 4, 2, 4, 6, 2, 12, 4, 2, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
The sequence has been chosen 0-indexed, as for A292794.
It has been conjectured that every even number occurs in this sequence.
It would be interesting to know whether there are patterns or formulae for the indices at which the respective even numbers occur.
The index of the first occurrence of 2n in this sequence is listed in A300004 = (1, 0, 5, 26, 14, ...): a(1), a(0), a(5), a(26), a(14), ... is the first occurrence of 2, 4, 6, 8, 10, ... in this sequence.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
Differences@ Join[{0}, Select[Range[3, 500], Function[n, NoneTrue[Block[{k = {1, 1}}, While[Last@k <= n, AppendTo[k, Total@ Take[k, -2]]]; Partition[Most@ k, 2, 1]], Mod[n, #2] == #1 & @@ # &]]]] (* Michael De Vlieger, Mar 19 2018 *)
|
|
PROG
|
(PARI) print1(L=0); for(n=1, oo, is_A292794(n)&&print1(", ", -L+L=n))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|