This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A270653 #24 Aug 09 2022 07:07:56
%S A270653 1,5,6,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,24,25,26,27,28,29,
%T A270653 30,31,32,33,34,35,36,37,38,39,40,41,42,44,45,46,47,48,49,50,51,52,53,
%U A270653 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
%N A270653 Integers k such that A003266(k) is divisible by k.
%C A270653 Note that this sequence is not the complement of A000057.
%C A270653 See A230359 for the prime terms of this sequence.
%H A270653 Amiram Eldar, <a href="/A270653/b270653.txt">Table of n, a(n) for n = 1..10000</a>
%e A270653 11 is a term because 1*1*2*3*5*8*13*21*34*55*89 is divisible by 11.
%t A270653 Select[Range@ 80, Divisible[Fibonorial@ #, #] &] (* Version 10, or *) Select[Range@ 80, Divisible[Product[Fibonacci@ k, {k, #}], #] &] (* _Michael De Vlieger_, Mar 23 2016 *)
%o A270653 (PARI) t(n) = prod(k=1, n, Mod(fibonacci(k), n));
%o A270653 for(n=1, 1e2, if(lift(t(n)) == 0, print1(n, ", ")));
%Y A270653 Complement of A270777.
%Y A270653 Cf. A000057, A003266, A230359.
%K A270653 nonn
%O A270653 1,2
%A A270653 _Altug Alkan_, Mar 20 2016