login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A270475
Integers n such that A003266(n) is not divisible by n*(n+1)/2.
1
2, 3, 4, 6, 7, 22, 23, 42, 43, 66, 67, 82, 83, 102, 103, 126, 127, 162, 163, 166, 167, 222, 223, 226, 227, 282, 283, 366, 367, 382, 383, 442, 443, 462, 463, 466, 467, 486, 487, 502, 503, 522, 523, 546, 547, 586, 587, 606, 607, 642, 643, 646, 647, 682, 683, 726, 727, 786, 787
OFFSET
1,1
COMMENTS
This sequence contains primes dividing all Fibonacci sequences.
EXAMPLE
6 is a term because (1*1*2*3*5*8) is not divisible by (1+2+3+4+5+6).
5 is not a term because (1*1*2*3*5) is divisible by (1+2+3+4+5).
MATHEMATICA
nn = 800; Function[k, Select[Range@ nn, ! Divisible[k[[#]], # (# + 1)/2] &]]@ FoldList[Times, Array[Fibonacci@ # &, nn]] (* Michael De Vlieger, Mar 19 2016 *)
PROG
(PARI) a(n) = prod(k=1, n, fibonacci(k));
for(n=1, 1e3, if(a(n) % (n*(n+1)/2) != 0, print1(n, ", ")));
CROSSREFS
KEYWORD
nonn
AUTHOR
Altug Alkan, Mar 17 2016
STATUS
approved