id:A000189 - OEIS Search Results

Search: id:A000189

Displaying 1-1 of 1 results found.

page 1

Number of solutions to x^3 == 0 (mod n).

+0
10

1, 1, 1, 2, 1, 1, 1, 4, 3, 1, 1, 2, 1, 1, 1, 4, 1, 3, 1, 2, 1, 1, 1, 4, 5, 1, 9, 2, 1, 1, 1, 8, 1, 1, 1, 6, 1, 1, 1, 4, 1, 1, 1, 2, 3, 1, 1, 4, 7, 5, 1, 2, 1, 9, 1, 4, 1, 1, 1, 2, 1, 1, 3, 16, 1, 1, 1, 2, 1, 1, 1, 12, 1, 1, 5, 2, 1, 1, 1, 4, 9, 1, 1, 2, 1, 1, 1, 4, 1, 3 (list; graph; listen)

	OFFSET	`1,4`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..10000` `H. Bottomley, Some Smarandache-type multiplicative sequences` `S. R. Finch and Pascal Sebah, Squares and Cubes Modulo n (arXiv:math.NT/0604465).`
	FORMULA	`Multiplicative with a(p^e) = p^[2e/3]. - David W. Wilson (davidwwilson(AT)comcast.net), Aug 01, 2001.`
	MATHEMATICA	`Array[ Function[ n, Count[ Array[ PowerMod[ #, 3, n ]&, n, 0 ], 0 ] ], 100 ]`
	CROSSREFS	`Cf. A019555.` `Sequence in context: A140130 A125653 A104445 this_sequence A000190 A003557 A073752` `Adjacent sequences: A000186 A000187 A000188 this_sequence A000190 A000191 A000192`
	KEYWORD	`nonn,mult`
	AUTHOR	`njas`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research