id:A119979 - OEIS Search Results

Search: id:A119979

Displaying 1-1 of 1 results found.

page 1

A119979

a(n+1)=(2^a(n) mod n)+1, with a(0)=1.

+0
1

1, 1, 3, 1, 3, 3, 2, 5, 6, 5, 11, 9, 6, 9, 3, 9, 3, 9, 19, 9, 9, 7, 14, 17, 23, 21, 9, 9, 20, 17, 5, 1, 3, 9, 23, 33, 15, 13, 3, 9, 21, 9, 40, 13, 3, 9, 43, 33, 30, 25, 3, 9, 36, 29, 18, 9, 57, 3, 9, 33, 54, 17, 33, 1, 3, 9, 44, 17, 42, 65, 21, 9, 2, 5, 33, 13, 31, 51, 68, 17, 15, 51, 56, 5, 33 (list; graph; listen)

	OFFSET	`0,3`
	FORMULA	`a(n+1)=(2^a(n) mod n)+1, with a(0)=0.`
	EXAMPLE	`a(0)=1.` `a(1)=(2^1 mod 1)+1=(2 mod 1)+1=0+1=1.` `a(2)=(2^1 mod 2)+1=(2 mod 2)+1=0+1=1.` `a(3)=(2^1 mod 3)+1=(2 mod 3)+1=2+1=3.` `a(4)=(2^3 mod 4)+1=(8 mod 4)+1=0+1=1`
	MAPLE	`P:=proc(n) local i, j, k; j:=0; k:=1; for i from 1 by 1 to n do j:=(2^k mod i)+1; k:=j; print(j); od; end: P(100);`
	CROSSREFS	`Sequence in context: A133599 A050306 A110629 this_sequence A143149 A059787 A081325` `Adjacent sequences: A119976 A119977 A119978 this_sequence A119980 A119981 A119982`
	KEYWORD	`easy,nonn`
	AUTHOR	`Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Aug 03 2006`

page 1

Search completed in 0.002 seconds

Last modified December 2 11:54 EST 2009. Contains 167921 sequences.

AT&T Labs Research