id:A115069 - OEIS Search Results

Search: id:A115069

Displaying 1-1 of 1 results found.

page 1

a(n)=3^b(n), where b(n) is #{primes p=1 mod 3 dividing n}.

+0
1

1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 3, 3, 1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 1, 3, 1, 3, 1, 1, 3, 1, 1, 1, 3, 1, 3, 3, 3, 1, 1, 3, 3, 1, 1, 1, 1, 1, 3, 1, 1, 3, 1, 1, 1, 3, 3, 1, 1, 1, 3, 3, 3, 1, 3, 1, 3, 1, 1, 3, 1, 1, 3, 3, 1, 3, 3, 3, 3, 1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 1, 9, 1, 3, 1, 3, 1, 3, 3, 1 (list; graph; listen)

	OFFSET	`2,6`
	LINKS	`S. R. Finch and Pascal Sebah, Squares and Cubes Modulo n (arXiv:math.NT/0604465).`
	CROSSREFS	`Cf. A005088, A060839.` `Sequence in context: A097558 A124385 A106478 this_sequence A046556 A046535 A135939` `Adjacent sequences: A115066 A115067 A115068 this_sequence A115070 A115071 A115072`
	KEYWORD	`nonn`
	AUTHOR	`S. R. Finch (Steven.Finch(AT)inria.fr), Mar 01 2006`

page 1

Search completed in 0.002 seconds

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.

AT&T Labs Research