login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064414 Fix a > 0, b > 0, k > 0 and define G_1 = a, G_2 = b, G_k = G_(k-1) + G_(k-2); sequence gives n such that for any (a,b), some G_k is divisible by n. 6
1, 2, 3, 4, 6, 7, 9, 14, 23, 27, 43, 49, 67, 81, 83, 86, 98, 103, 127, 134, 163, 167, 206, 223, 227, 243, 254, 283, 326, 343, 367, 383, 443, 446, 463, 467, 487, 503, 523, 529, 547, 566, 587, 607, 643, 647, 683, 686, 727, 729, 734, 787, 823, 827, 863, 883, 887 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

Teruo Nishiyama, Fibonacci numbers, Suuri-Kagaku, No. 285, March 1987, 67-69, (in Japanese).

LINKS

Table of n, a(n) for n=1..57.

B. Avila and T. Khovanova, Free Fibonacci Sequences, arXiv preprint arXiv:1403.4614, 2014

EXAMPLE

If a = 1, b = 4, then G_k is (1,4,5,9,14,23,....) and no G_k is a multiple of 11. Therefore 11 is not in the sequence.

MATHEMATICA

g[a_, b_, k_] := Fibonacci[k-2]*a + Fibonacci[k-1]*b; ok[n_] := Catch[ Do[ test = Catch[ Do[ If[ Divisible[g[a, b, k], n], Throw[True]], {k, 1, 2*n}]]; If[test == Null, Throw[False]], {a, 1, Floor[Sqrt[n]]}, {b, 1, Floor[Sqrt[n]]}]] ; Reap[ Do[ If[ok[n] == Null, Print[n]; Sow[n]], {n, 1, 1000}]][[2, 1]] (* Jean-Fran├žois Alcover, Jul 19 2012 *)

CROSSREFS

Prime members are in A000057.

Sequence in context: A055494 A239115 A165773 * A224482 A002475 A208281

Adjacent sequences:  A064411 A064412 A064413 * A064415 A064416 A064417

KEYWORD

easy,nonn,nice

AUTHOR

Naohiro Nomoto, Oct 15 2001

EXTENSIONS

More terms from David Wasserman, Jul 18 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified November 28 09:35 EST 2014. Contains 250303 sequences.