|
Search: id:A060956
|
|
| |
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=0,...,1000
|
|
FORMULA
|
a(n) = [3^n / 10^([log_10(3^n) ]) ] = [3^n / 10^([n*log_10(3) ]) ]
|
|
MATHEMATICA
|
f[n_] := Quotient[3^n, 10^Floor[n*Log[10, 3]]]; Table[ f@n, {n, 0, 104}] (* Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 09 2008 *)
|
|
PROGRAM
|
(PARI) { default(realprecision, 100); for (n=0, 1000, t=log(3)/log(10); write("b060956.txt", n, " ", 3^n \ 10^floor(n*t)); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 15 2009]
|
|
CROSSREFS
|
Sequence in context: A021722 A094724 A008564 this_sequence A125301 A140985 A098323
Adjacent sequences: A060953 A060954 A060955 this_sequence A060957 A060958 A060959
|
|
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
|
|
|
Search completed in 0.002 seconds
|
