id:A087964 - OEIS Search Results

Search: id:A087964

Displaying 1-1 of 1 results found.

page 1

a(n) is the least prime p such that exponent of highest power of 2 dividing 3p+1 equals n.

+0
1

3, 17, 13, 5, 53, 149, 1237, 1109, 853, 2389, 3413, 17749, 128341, 70997, 251221, 415061, 218453, 2708821, 27088213, 29709653, 3495253, 85284181, 13981013, 39146837, 794121557, 1498764629, 492131669, 626349397, 13779686741 (list; graph; listen)

	OFFSET	`1,1`
	FORMULA	`a(n)=p[Min{x; A007814[1+3.A000040[x]]=n}`
	EXAMPLE	`p=218453 is the first prime so that 3.p+1=655360=(2^18).5 has 18 as exponent of 2 in 3p+1, thus a[18]=218453.`
	CROSSREFS	`Cf. A087272-A087274, A007814, A087230, A087963.` `Sequence in context: A033467 A096475 A088122 this_sequence A120448 A095422 A059189` `Adjacent sequences: A087961 A087962 A087963 this_sequence A087965 A087966 A087967`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Sep 18 2003`
	EXTENSIONS	`More terms from Ray Chandler (rayjchandler(AT)sbcglobal.net), Sep 21 2003`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research