Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068894
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068894 a(1) = 1; a(n) is the smallest n-th power which is congruent to 1 mod a(n-1). +0
3
1, 4, 125, 10556001, 131068195168072318688258971724480032 (list; graph; listen)
OFFSET

1,2

EXAMPLE

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

PROGRAM

(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

Adjacent sequences: A068891 A068892 A068893 this_sequence A068895 A068896 A068897

Sequence in context: A090082 A068891 A073351 this_sequence A116944 A124260 A054053

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Mar 20 2002

EXTENSIONS

Corrected and extended by Ralf Stephan (ralf(AT)ark.in-berlin.de), Mar 21 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 12 13:44 EDT 2008. Contains 144830 sequences.


AT&T Labs Research