Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A025544
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A025544 a(n) = sum of the exponents in the prime factorization of the least common multiple of the first n composite numbers. +0
1
2, 3, 4, 5, 6, 6, 7, 7, 8, 8, 8, 8, 9, 9, 10, 11, 12, 12, 12, 13, 13, 14, 14, 14, 15, 15, 15, 15, 15, 15, 16, 16, 17, 17, 17, 17, 17, 17, 17, 17, 18, 18, 19, 19, 20, 20, 20, 20, 20, 20, 20, 21, 21, 21, 21, 21, 21, 22, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 25, 25, 25, 25, 25, 25 (list; graph; listen)
OFFSET

1,1

FORMULA

a(n) = A001222(A025543(n+1)).

CROSSREFS

Sequence in context: A097622 A110010 A091987 this_sequence A121856 A132172 A080680

Adjacent sequences: A025541 A025542 A025543 this_sequence A025545 A025546 A025547

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), May 01 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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research