Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A025532
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A025532 a(n) = sum of exponents in prime factorization of LCM{C(n,0), C(n,1), ..., C(n,n)}. +0
1
0, 0, 1, 1, 3, 2, 4, 3, 5, 5, 7, 5, 8, 7, 7, 6, 10, 8, 11, 9, 10, 10, 12, 9, 12, 12, 12, 12, 15, 13, 16, 13, 16, 16, 16, 14, 18, 17, 17, 15, 19, 17, 20, 18, 18, 19, 21, 17, 21, 20, 21, 20, 23, 20, 22, 20, 22, 22, 24, 21, 25, 24, 23, 21, 25, 24, 27, 25, 26, 25, 28, 24, 29, 28, 27 (list; graph; listen)
OFFSET

0,5

PROGRAM

(PARI) for(n=0, 100, l=1:for(k=0, n, l=lcm(l, binomial(n, k))):v=factor(l):s=0:for(k=1, matsize(v)[1], s=s+v[k, 2]):print1(s", "))

CROSSREFS

Sequence in context: A119707 A052938 A140114 this_sequence A133131 A026923 A058708

Adjacent sequences: A025529 A025530 A025531 this_sequence A025533 A025534 A025535

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

More terms from Ralf Stephan (ralf(AT)ark.in-berlin.de), Mar 28 2003

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 December 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research