The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A249104 Defective numbers: A complete residue system mod a(n) does not exist in the Fibonacci sequence. 1
 8, 11, 12, 13, 16, 17, 18, 19, 21, 22, 23, 24, 26, 28, 29, 31, 32, 33, 34, 36, 37, 38, 39, 40, 41, 42, 43, 44, 46, 47, 48, 49, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 71, 72, 73, 74, 76, 77, 78, 79, 80, 82, 83, 84, 85, 86, 87 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Every multiple of a member is a member. Every integer 2^r*m (r>2, m odd) is a member. Every prime p congruent 1, 9, 11, 13, 17, 19 (mod 20) is a member (see reference). LINKS Table of n, a(n) for n=1..66. A. P. Shah, Fibonacci Sequence Modulo m, Fibonacci Quarterly, Vol.6, No.2 (1968), 139-141. FORMULA A066853(a(n)) < a(n) in ascending order. EXAMPLE 16 is a member because A066853(16) = 11 < 16. PROG (PARI) isok(k) = {if(k<8, return(0)); my(v=List([1, 2])); while(v[#v]!=1 || v[#v-1]!=0, listput(v, (v[#v]+v[#v-1])%k)); #Set(v)

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

Last modified April 20 09:30 EDT 2024. Contains 371799 sequences. (Running on oeis4.)