|
Search: id:A038500
|
|
|
| A038500 |
|
Highest power of 3 dividing n. |
|
+0
19
|
|
| 1, 1, 3, 1, 1, 3, 1, 1, 9, 1, 1, 3, 1, 1, 3, 1, 1, 9, 1, 1, 3, 1, 1, 3, 1, 1, 27, 1, 1, 3, 1, 1, 3, 1, 1, 9, 1, 1, 3, 1, 1, 3, 1, 1, 9, 1, 1, 3, 1, 1, 3, 1, 1, 27, 1, 1, 3, 1, 1, 3, 1, 1, 9, 1, 1, 3, 1, 1, 3, 1, 1, 9, 1, 1, 3, 1, 1, 3, 1, 1, 81
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
To construct the sequence: start with 1 and concatenate twice: 1,1,1 then triple the last term gives: 1,1,3. Concatenate those 3 terms twice gives: 1,1,3,1,1,3,1,1,3, triple the last term -> 1,1,3,1,1,3,1,1,9. Concatenate those 9 terms twice gives: 1,1,3,1,1,3,1,1,9,1,1,3,1,1,3,1,1,9,1,1,3,1,1,3,1,1,9, triple the last term -> 1,1,3,1,1,3,1,1,9,1,1,3,1,1,3,1,1,9,1,1,3,1,1,3,1,1,27 etc. - Benoit Cloitre (benoit7848c(AT)orange.fr), Dec 17 2002
|
|
LINKS
|
Z. Sunic, Tree morphisms, transducers and integer sequences
|
|
FORMULA
|
Multiplicative with a(p^e) = if p = 3, then 3^e, else 1. - Mitch Harris, Apr 19 2005.
|
|
PROGRAM
|
(PARI) a(n)=3^valuation(n, 3)
|
|
CROSSREFS
|
Cf. A007949.
Sequence in context: A110787 A139002 A139378 this_sequence A091840 A083985 A109848
Adjacent sequences: A038497 A038498 A038499 this_sequence A038501 A038502 A038503
|
|
KEYWORD
|
nonn,mult
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
