id:A135366 - OEIS Search Results

Search: id:A135366

Displaying 1-1 of 1 results found.

page 1

a(n) is the smallest nonnegative k such that n divides 2^k+k.

+0
1

0, 2, 1, 4, 4, 2, 6, 8, 7, 6, 3, 8, 12, 6, 7, 16, 16, 14, 18, 4, 19, 8, 22, 8, 33, 12, 7, 40, 11, 26, 23, 32, 8, 16, 6, 32, 5, 18, 37, 24, 40, 38, 42, 8, 7, 22, 10, 32, 61, 84, 38, 12, 35, 32, 46, 40, 32, 28, 24, 44 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`a(2^m)=2^m for m>0. If p is prime then by Fermat, a(p)<=p-1. 25 is the smallest n with a(n)>n.`
	EXAMPLE	`a(9)=7 since 2^7+7= 9*15, and 2^k+k is not divisible by 9 for 0<=k<7.`
	CROSSREFS	`Adjacent sequences: A135363 A135364 A135365 this_sequence A135367 A135368 A135369` `Sequence in context: A128250 A086145 A113421 this_sequence A051289 A090802 A129159`
	KEYWORD	`nonn`
	AUTHOR	`John L. Drost (drost(AT)marshall.edu), Feb 16 2008`

page 1

Search completed in 0.002 seconds

Last modified October 11 09:12 EDT 2008. Contains 144832 sequences.

AT&T Labs Research