A068894 - OEIS

This site is supported by donations to The OEIS Foundation.

A068894

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

1, 4, 125, 10556001, 131068195168072318688258971724480032 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,2`
	EXAMPLE	`a(3) = 125 = 5^3 = 31a(2) + 1 where a(2) = 4=2^2 = 31 + 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: A068891 A073351 A195797 * A116944 A124260 A178842` `Adjacent sequences: A068891 A068892 A068893 * A068895 A068896 A068897`
	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`

Content is available under The OEIS End-User License Agreement .

Last modified February 15 10:56 EST 2012. Contains 205763 sequences.