Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079167
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A079167 Weighted roundness of n. If n=p_1^e_1...p^k_e^k, then a(n) = e_1+2.e_2+...+k.e_k. Note that p_i<p_j, i<j, is assumed. +0
3
1, 1, 2, 1, 3, 1, 3, 2, 3, 1, 4, 1, 3, 3, 4, 1, 5, 1, 4, 3, 3, 1, 5, 2, 3, 3, 4, 1, 6, 1, 5, 3, 3, 3, 6, 1, 3, 3, 5, 1, 6, 1, 4, 4, 3, 1, 6, 2, 5, 3, 4, 1, 7, 3, 5, 3, 3, 1, 7, 1, 3, 4, 6, 3, 6, 1, 4, 3, 6, 1, 7, 1, 3, 5, 4, 3, 6, 1, 6, 4, 3, 1, 7, 3, 3, 3, 5, 1, 8, 3, 4, 3, 3, 3, 7, 1, 5, 4, 6, 1, 6, 1, 5, 6, 3 (list; graph; listen)
OFFSET

2,3

EXAMPLE

a(10) = 3 as 10=2.5, therefore a(10) = 1.1+2.1=1+2=3.

PROGRAM

(PARI) weightedroundness(n) = local(f, fl, s); f=factor(n); fl=length(f[, 1]); s=0; for (i=1, fl, s=s+i*f[, 2][i]); s alias(wr, weightedroundness) for (j=2, 500, print1(wr(j)", "))

CROSSREFS

Cf. A079168, A079169, A001222.

Sequence in context: A083868 A128199 A036459 this_sequence A032741 A046051 A025812

Adjacent sequences: A079164 A079165 A079166 this_sequence A079168 A079169 A079170

KEYWORD

nonn

AUTHOR

Jon Perry (perry(AT)globalnet.co.uk), Dec 31 2002

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research