login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000189 Number of solutions to x^3 == 0 (mod n). 13
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; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

Shadow transform of the cubes A000578. - Michel Marcus, Jun 06 2013

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).

N. J. A. Sloane, Transforms

FORMULA

Multiplicative with a(p^e) = p^[2e/3]. - David W. Wilson, Aug 01 2001

MATHEMATICA

Array[ Function[ n, Count[ Array[ PowerMod[ #, 3, n ]&, n, 0 ], 0 ] ], 100 ]

PROG

(PARI) a(n)=my(f=factor(n)); prod(i=1, #f[, 1], f[i, 1]^(2*f[i, 2]\3)) \\ Charles R Greathouse IV, Jun 06 2013

CROSSREFS

Cf. A019555.

Sequence in context: A220632 A125653 A104445 * A000190 A003557 A073752

Adjacent sequences:  A000186 A000187 A000188 * A000190 A000191 A000192

KEYWORD

nonn,mult,easy

AUTHOR

N. J. A. Sloane

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 15 20:49 EST 2018. Contains 318154 sequences. (Running on oeis4.)