cp's OEIS Frontend

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.

A213085 First occurrence of n in A212844.

Original entry on oeis.org

1, 7, 3, 5, 6, 9, 10, 55, 11, 3521, 246, 21, 52, 89969, 286, 60827, 22, 57481, 1501, 31937, 44, 2977, 49, 27, 40, 39806401, 110, 16777, 114, 214293, 24823, 247, 33, 259274569, 222, 2739, 70, 5993, 253217, 1062899, 72, 2007, 215, 85, 140, 4187, 50, 75
Offset: 0

Views

Author

Alex Ratushnyak, Jul 22 2012

Keywords

Comments

It is conjectured that every integer n>=0 appears in A212844 at least once, and therefore every a(n) is defined.
Indices of terms that are bigger than 2^32-1 and possibly undefined: 69, 91, 114, 127, 141, 157, 175, 181, 195, 301, 313, 339, ...
Indices 69, 127, 175, 181, 301, 313, 339, ... correspond to terms that either do not exist or are greater than 2*10^12. - Charles R Greathouse IV, Aug 13 2015

Examples

			Smallest n such that A212844(n)=1 is 7, so a(1)=7.
		

Crossrefs

Programs

  • PARI
    a(n) = my(k=1); while(lift(Mod(2, k)^(k+2)) != n, k++); k; \\ Michel Marcus, Aug 14 2015