id:A087963 - OEIS Search Results

Search: id:A087963

Displaying 1-1 of 1 results found.

page 1

Exponent of highest power of 2 dividing 3*prime(n)+1.

+0
2

1, 1, 4, 1, 1, 3, 2, 1, 1, 3, 1, 4, 2, 1, 1, 5, 1, 3, 1, 1, 2, 1, 1, 2, 2, 4, 1, 1, 3, 2, 1, 1, 2, 1, 6, 1, 3, 1, 1, 3, 1, 5, 1, 2, 4, 1, 1, 1, 1, 4, 2, 1, 2, 1, 2, 1, 3, 1, 6, 2, 1, 4, 1, 1, 2, 3, 1, 2, 1, 3, 2, 1, 1, 5, 1, 1, 4, 3, 2, 2, 1, 4, 1, 2, 1, 1, 2, 2, 3, 1, 1, 1, 1, 1, 1, 1, 3, 2, 1, 3, 1, 3, 1, 2, 1 (list; graph; listen)

	OFFSET	`1,3`
	FORMULA	`a(n)=A007814[1+3.A000040[n]]]`
	EXAMPLE	`n=10:p(10)=29, 3p+1=88, a[10]=3, exponent of 8.`
	MATHEMATICA	`ffi[x_] := Flatten[FactorInteger[x]] e2[x_] := Part[[ffi[x]], 2] Table[e2[3*Prime[w]+1], {w, 1, 100}]`
	CROSSREFS	`Cf. A087272-A087274, A007814, A087230.` `Sequence in context: A010325 A111311 A016524 this_sequence A010323 A100642 A014518` `Adjacent sequences: A087960 A087961 A087962 this_sequence A087964 A087965 A087966`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Sep 18 2003`

page 1

Search completed in 0.002 seconds

Last modified July 23 17:35 EDT 2008. Contains 142285 sequences.

AT&T Labs Research