login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053789 a(n) = A020639(A053790(n)). 1
2, 2, 2, 7, 2, 3, 2, 2, 2, 3, 2, 3, 2, 3, 2, 7, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 41, 2, 3, 2, 3, 2, 3, 2, 3, 2, 59, 2, 7, 2, 3, 2, 3, 2, 7, 2, 37, 2, 2, 5, 2, 2, 89, 2, 3, 2, 3, 2, 7, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 13, 2, 109, 2, 2, 17, 2, 2, 2, 7, 2, 7, 2, 2, 7, 2 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

EXAMPLE

a(4) = 7 because the sum of the first 8 primes is 77 and 7 is its least prime divisor.

CROSSREFS

Cf. A013918, A053790, A020639.

Sequence in context: A098920 A129365 A021453 * A115596 A202033 A029610

Adjacent sequences:  A053786 A053787 A053788 * A053790 A053791 A053792

KEYWORD

easy,nonn

AUTHOR

Enoch Haga (Enokh(AT)comcast.net), Mar 27 2000

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com), Mar 16 2008, following explication by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 26 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 11:36 EST 2012. Contains 205623 sequences.