The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A068894 a(1) = 1; a(n) is the smallest n-th power which is congruent to 1 mod a(n-1). 2
 1, 4, 125, 10556001, 131068195168072318688258971724480032 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS EXAMPLE a(3) = 125 = 5^3 = 31*a(2) + 1 where a(2) = 4=2^2 = 3*1 + 1. PROG (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))) CROSSREFS Sequence in context: A073351 A195797 A286017 * A116944 A124260 A253099 Adjacent sequences:  A068891 A068892 A068893 * A068895 A068896 A068897 KEYWORD nonn AUTHOR Amarnath Murthy, Mar 20 2002 EXTENSIONS Corrected and extended by Ralf Stephan, Mar 21 2003 STATUS approved

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

Last modified August 16 04:50 EDT 2022. Contains 356150 sequences. (Running on oeis4.)