login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A002994 Initial digit of cubes.
(Formerly M4468)
12
0, 1, 8, 2, 6, 1, 2, 3, 5, 7, 1, 1, 1, 2, 2, 3, 4, 4, 5, 6, 8, 9, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 4, 4, 5, 5, 5, 6, 6, 7, 7, 8, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
a(n) = A000030(A000578(n)). - Reinhard Zumkeller, Aug 17 2008
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Eric Weisstein's World of Mathematics, Gelfand's Question
MAPLE
a:= n-> parse(""||(n^3)[1]):
seq(a(n), n=0..100); # Alois P. Heinz, Aug 06 2021
MATHEMATICA
a[n_] := First[IntegerDigits[n^3]]; Table[a[n], {n, 0, 100}] (* Vladimir Joseph Stephan Orlovsky, Dec 21 2008 *)
PROG
(Haskell)
a002994 = a000030 . a000578 -- Reinhard Zumkeller, Apr 01 2015
(PARI) a(n) = if (n, digits(n^3)[1], 0); \\ Michel Marcus, Dec 13 2017
CROSSREFS
Sequence in context: A179954 A197518 A248300 * A097408 A228818 A195845
KEYWORD
nonn,easy,base
AUTHOR
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 4 11:57 EST 2023. Contains 367560 sequences. (Running on oeis4.)