id:A064434 - OEIS Search Results

Search: id:A064434

Displaying 1-1 of 1 results found.

page 1

a(n) = remainder of (2*a(n-1) + 1) when divided by n.

+0
3

0, 1, 0, 1, 3, 1, 3, 7, 6, 3, 7, 3, 7, 1, 3, 7, 15, 13, 8, 17, 14, 7, 15, 7, 15, 5, 11, 23, 18, 7, 15, 31, 30, 27, 20, 5, 11, 23, 8, 17, 35, 29, 16, 33, 22, 45, 44, 41, 34, 19, 39, 27, 2, 5, 11, 23, 47, 37, 16, 33, 6, 13, 27, 55, 46, 27, 55, 43, 18, 37, 4, 9, 19, 39, 4, 9, 19, 39, 0 (list; graph; listen)

	OFFSET	`1,5`
	COMMENT	`Can be generalized to a(n) = f(a(n-1)) mod n, where f is any polynomial function.`
	FORMULA	`a(n) = (a(n-1) * 2 + 1 ) mod n`
	EXAMPLE	`0, (02+1) mod 2 = 1, (12+1) mod 3 = 0, (02+1) mod 4 = 1, (12+1) mod 5 = 3 (3*2+1) mod 6 =1`
	CROSSREFS	`Cf. A064456.` `Adjacent sequences: A064431 A064432 A064433 this_sequence A064435 A064436 A064437` `Sequence in context: A107461 A035619 A092689 this_sequence A086401 A095732 A001644`
	KEYWORD	`nonn`
	AUTHOR	`Jonathan Ayres (JonathanAyres(AT)btinternet.com), Oct 01 2001`

page 1

Search completed in 0.002 seconds

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.

AT&T Labs Research