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.

A068894 a(1) = 1; a(n) is the smallest n-th power which is congruent to 1 mod a(n-1).

Original entry on oeis.org

1, 4, 125, 10556001, 131068195168072318688258971724480032
Offset: 1

Views

Author

Amarnath Murthy, Mar 20 2002

Keywords

Examples

			a(3) = 125 = 5^3 = 31*a(2) + 1 where a(2) = 4=2^2 = 3*1 + 1.
		

Programs

  • PARI
    v=vector(15):v[2]=4:print1("1,4,"):for(n=3,15, for(k=2,10^8,if(((k^n)%(v[n-1]))==1,print1(k^n","):v[n]=k^n:break)))

Extensions

Corrected and extended by Ralf Stephan, Mar 21 2003