Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134599
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134599 Sum of digital sums (base 3) of the prime factors of n. +0
21
2, 1, 4, 3, 3, 3, 6, 2, 5, 3, 5, 3, 5, 4, 8, 5, 4, 3, 7, 4, 5, 5, 7, 6, 5, 3, 7, 3, 6, 3, 10, 4, 7, 6, 6, 3, 5, 4, 9, 5, 6, 5, 7, 5, 7, 5, 9, 6, 8, 6, 7, 7, 5, 6, 9, 4, 5, 5, 8, 5, 5, 5, 12, 6, 6, 5, 9, 6, 8, 7, 8, 5, 5, 7, 7, 6, 6, 7, 11, 4, 7, 3, 8, 8, 7, 4, 9, 5, 7, 6, 9, 4, 7, 6, 11, 5, 8, 5, 10, 5, 8, 5, 9, 7 (list; graph; listen)
OFFSET

2,1

FORMULA

If p_1*p_2*p_3* ... *p_m=n is the unique prime factorization of n, then a(n)=sum{1<=k<=m, ds_3(p_k)}, where ds_3 is the digital sum base 3.

EXAMPLE

a(6)=3, since 6=2*3 and so a(6)=ds_3(2)+ds_3(3)=2+1.

CROSSREFS

Cf. A007953, A118503, A134598.

Adjacent sequences: A134596 A134597 A134598 this_sequence A134600 A134601 A134602

Sequence in context: A098122 A094322 A136757 this_sequence A117235 A102916 A081234

KEYWORD

nonn,base

AUTHOR

Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Nov 11 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified January 8 02:43 EST 2009. Contains 152824 sequences.


AT&T Labs Research