|
%I #17 Feb 28 2018 15:27:01
%S 5,8,10,12,13,15,16,17,20,21,24,25,26,28,30,32,33,34,35,36,37,39,40,
%T 42,45,48,50,51,52,53,55,56,57,60,61,63,64,65,66,68,69,70,72,73,74,75,
%U 77,78,80,84,85,87,88,89,90,91,92,93,95,96,97,99,100,102,104
%N Numbers n such that no Lucas number is a multiple of n.
%C Any positive multiple of a member of this sequence is also a member. Primitive elements are in A124378. - _Franklin T. Adams-Watters_, Oct 28 2006
%C The Mathematica code for testing the number n works by generating the Lucas sequence (mod n) and stopping when either n divides a term of the sequence or the entire sequence (mod n) has been generated. Hence, up to A106291(n) terms need to be computed. - _T. D. Noe_, Mar 20 2013
%D Teruo Nishiyama, Fibonacci numbers, Suuri-Kagaku, No. 285, March 1987, 67-69, (in Japanese).
%H T. D. Noe, <a href="/A064362/b064362.txt">Table of n, a(n) for n = 1..1000</a>
%H B. Avila and T. Khovanova, <a href="http://arxiv.org/abs/1403.4614">Free Fibonacci Sequences</a>, arXiv preprint arXiv:1403.4614, 2014 and <a href="https://cs.uwaterloo.ca/journals/JIS/VOL17/Avila/avila4.html">J. Int. Seq. 17 (2014) # 14.8.5</a>
%t test[ n_ ] := For[ a=1; b=3, True, t=b; b=Mod[ a+b, n ]; a=t, If[ b==0, Return[ True ] ]; If[ a==2&&b==1, Return[ False ] ] ]; Select[ Range[ 110 ], !test[ # ]& ]
%Y Complement of A065156.
%Y Cf. A000032, A124378.
%K easy,nonn
%O 1,1
%A _Naohiro Nomoto_, Oct 15 2001
%E More terms from _Dean Hickerson_, Oct 18, 2001
|
