This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A182580 Position of first occurrence of n in A182576. 1
 0, 1, 2, 5, 11, 27, 29, 46, 76, 167, 133, 348, 521, 1160, 1364, 3005, 3571, 9348, 9349, 20820, 24476, 64062, 64079, 123651, 167761, 439203, 439204, 1149850, 1149851, 3010348, 3010349, 7881195, 7881196, 20633238, 20633239, 54018520, 54018521, 141422323, 141422324 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Conjecture: for k > 12, a(2k) = a(2k-1) + 1. LINKS EXAMPLE First occurrence of 4 in A182576(n) has index 11, so a(4)=11. PROG (C) #include // GCC // ~880 secs typedef unsigned long long U64; U64 fibs[992], first[992], prpr=0, prev=1, current, n, sq; long long ftop, fpos, terms; int main(int argc, char **argv) {     for (ftop=0; ftop<900; ++ftop) {       fibs[ftop] = current = prpr+prev;       if (current0 && fpos>=0; ++terms, sq-=fibs[fpos], --fpos) {                 while (fibs[fpos]>sq && fpos>0) --fpos;         }         if (sq>0) { printf("Error!"); exit(1); }         if (first[terms]==0)             first[terms]=n, printf("%2llu %llu\n", terms, n);     }     for (n=0; n

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

Last modified October 21 20:51 EDT 2018. Contains 316428 sequences. (Running on oeis4.)