Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102845
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A102845 Number of prime factors of the sum of the first n odd primes. +0
1
1, 3, 2, 2, 2, 4, 3, 3, 1, 2, 3, 3, 3, 2, 1, 3, 1, 2, 3, 3, 2, 4, 2, 3, 2, 2, 2, 2, 2, 2, 2, 3, 4, 3, 3, 2, 4, 7, 2, 8, 3, 5, 2, 4, 4, 3, 2, 3, 4, 4, 2, 4, 1, 9, 1, 4, 3, 6, 2, 6, 1, 6, 2, 5, 1, 4, 2, 5, 3, 3, 1, 4, 3, 5, 1, 6, 2, 3, 2, 4, 3, 4, 3, 2, 2, 5, 2, 7, 2, 4, 2, 8, 3, 4, 1, 2, 4, 4, 2, 5, 4, 2, 4, 2, 2 (list; graph; listen)
OFFSET

1,2

EXAMPLE

a(2)=3 because 3+5=8=2*2*2;

a(3)=2 because 3+5+7=15=3*5.

PROGRAM

(PARI) for(n=1, 105, print1(bigomega(sum(k=1, n, prime(k+1))), ", ")) (Shepherd)

CROSSREFS

Sequence in context: A104890 A064123 A024703 this_sequence A064126 A130845 A134653

Adjacent sequences: A102842 A102843 A102844 this_sequence A102846 A102847 A102848

KEYWORD

easy,nonn

AUTHOR

Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Feb 28 2005

EXTENSIONS

More terms from Rick L. Shepherd (rshepherd2(AT)hotmail.com), May 18 2005

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