login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A060956
Leading digit of 3^n.
8
1, 3, 9, 2, 8, 2, 7, 2, 6, 1, 5, 1, 5, 1, 4, 1, 4, 1, 3, 1, 3, 1, 3, 9, 2, 8, 2, 7, 2, 6, 2, 6, 1, 5, 1, 5, 1, 4, 1, 4, 1, 3, 1, 3, 9, 2, 8, 2, 7, 2, 7, 2, 6, 1, 5, 1, 5, 1, 4, 1, 4, 1, 3, 1, 3, 1, 3, 9, 2, 8, 2, 7, 2, 6, 2, 6, 1, 5, 1, 4, 1, 4, 1, 3, 1, 3, 1, 3, 9, 2, 8, 2, 7, 2, 7, 2, 6, 1, 5, 1, 5, 1, 4, 1, 4
OFFSET
0,2
REFERENCES
He, Xinwei; Hildebrand, A J; Li, Yuchen; Zhang, Yunyi, Complexity of Leading Digit Sequences, Discrete Mathematics and Theoretical Computer Science; 22 (2020), #14.
LINKS
Dmitry Kamenetsky, First digit of 3^2020, Puzzling StackExchange.
FORMULA
a(n) = floor(3^n / 10^floor(log_10(3^n))) = floor( 3^n / 10^floor(n*log_10(3)) ).
a(n) = A000030(A000244(n)). - Michel Marcus, Jul 03 2018
MATHEMATICA
First[IntegerDigits[#]]&/@(3^Range[0, 110]) (* Harvey P. Dale, May 16 2016 *)
PROG
(PARI) a(n) = { 3^n \ 10^logint(3^n, 10) } \\ Harry J. Smith, Jul 15 2009
CROSSREFS
Sequence in context: A008564 A348371 A354129 * A125301 A347214 A263559
KEYWORD
nonn,base,easy
AUTHOR
Ahmed Fares (ahmedfares(AT)my-deja.com), May 08 2001
EXTENSIONS
More terms from Larry Reeves (larryr(AT)acm.org), May 11 2001
STATUS
approved