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.

A285173 Numbers n such that A002496(n+1) < A002496(n)^(1+1/n).

Original entry on oeis.org

3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70
Offset: 1

Views

Author

Felix Fröhlich, May 06 2017

Keywords

Comments

Conjecture: The sequence is the complement of 1, 2, 4, 351 in A000027 (cf. Sun, 2013, Conjecture 2.6. (i)).

References

  • Zhi-Wei Sun, Conjectures involving arithmetical sequences, in: Number Theory: Arithmetic in Shangri-La (eds., S. Kanemitsu, H. Li and J. Liu), Proceedings of the 6th China-Japan Seminar (Shanghai, August 15-17, 2011), World Scientific Publishing, Singapore, 2013, pp. 244-258.

Crossrefs

Programs

  • PARI
    a002496(n) = my(k=1, i=0); while(i < n, if(ispseudoprime(k^2+1), i++); if(i==n, return(k^2+1)); k++)
    is(n) = a002496(n+1) < a002496(n)^(1+1/n)