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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A104640 Number of odd digits in n^3. 7
1, 0, 1, 0, 2, 1, 2, 2, 2, 1, 4, 2, 3, 1, 4, 1, 3, 2, 2, 0, 2, 1, 3, 2, 3, 4, 3, 3, 2, 1, 4, 2, 5, 3, 2, 1, 3, 2, 5, 0, 2, 1, 4, 2, 4, 4, 3, 4, 4, 2, 4, 1, 3, 3, 4, 4, 5, 5, 4, 1, 2, 2, 2, 1, 2, 2, 3, 3, 3, 2, 6, 3, 4, 1, 3, 3, 4, 3, 4, 2, 4, 4, 5, 3, 3, 2, 3, 2, 3, 2, 6, 2, 3, 2, 5, 2, 4, 4, 4, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

LINKS

G. C. Greubel, Table of n, a(n) for n = 1..10000

FORMULA

a(n) = A196564(n^3). - Michel Marcus, Oct 05 2013

MATHEMATICA

Table[Count[IntegerDigits[n^3], _?OddQ], {n, 100}] (* Harvey P. Dale, Jun 23 2017 *)

PROG

(PARI) a(n) = my(d = digits(n^3)); sum(i=1, #d, d[i] % 2); \\ Michel Marcus, Oct 05 2013

CROSSREFS

Cf. A104639, A196564.

Sequence in context: A218654 A054571 A126865 * A193335 A016727 A241318

Adjacent sequences:  A104637 A104638 A104639 * A104641 A104642 A104643

KEYWORD

easy,nonn,base

AUTHOR

Zak Seidov, Mar 18 2005

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 May 25 04:50 EDT 2019. Contains 323539 sequences. (Running on oeis4.)