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.

A083205 a(1) = 1, then smallest number not included earlier such that a(n)*a(n+1) + 1 is an n-th power.

Original entry on oeis.org

1, 2, 4, 31, 26129, 466202136816810031, 10584868011442581563053546190350068005080430521324963528734180259722815036145
Offset: 1

Views

Author

Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), Apr 28 2003

Keywords

Comments

The sequence is infinite and a(n+1) <= ([a(n)+1]^n - 1)/a(n) when n is even, or a(n+1) <= ([a(n)-1]^n - 1)/a(n) when n is odd.
To find a(6), we need an x such that x^5 = 1 (mod a(5)); then a(6) = (x^5 - 1)/a(5). The multiplicative group mod a(5) has order phi(a(5)) = 23296, which is not divisible by 5. So the only 5th root of 1 in this group is 1. x = 1 would give a(6) = 0, this is not allowed, so we take x to be the next representative of 1 mod a(5), i.e. a(5)+1. So a(6) = [(a(5)+1)^5 - 1]/a(5). - David Wasserman, Mar 02 2004
Next term is approximately 8.1*10^451. - David Wasserman, May 26 2004

Examples

			a(4) = 31, a(5) = 26129, 31*26129 + 1 = 810000 = 30^4.
		

Crossrefs

Extensions

More terms from David Wasserman, Mar 02 2004