Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A111290
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A111290 a(1)=1, a(n) = n + (sum of distinct primes dividing a(n-1)). +0
1
1, 2, 5, 9, 8, 8, 9, 11, 20, 17, 28, 21, 23, 37, 52, 31, 48, 23, 42, 32, 23, 45, 31, 55, 41, 67, 94, 77, 47, 77, 49, 39, 49, 41, 76, 57, 59, 97, 136, 59, 100, 49, 50, 51, 65, 64, 49, 55, 65, 68, 70, 66, 69, 80, 62, 89, 146, 133, 85, 82, 104, 77, 81, 67, 132, 82, 110, 86, 114, 94 (list; graph; listen)
OFFSET

1,2

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

EXAMPLE

a(10) = 10 + (sum of distinct primes dividing 20) = 10 + 2 + 5 = 17.

PROGRAM

(PARI) b=1; for(i=2, 100, v=factor(b); b=i+sum(j=1, matsize(v)[1], v[j, 1]); print1(b, ", ")) (Klasen)

CROSSREFS

Sequence in context: A053477 A104956 A020820 this_sequence A129140 A002580 A091656

Adjacent sequences: A111287 A111288 A111289 this_sequence A111291 A111292 A111293

KEYWORD

nonn

AUTHOR

Leroy Quet Nov 01 2005

EXTENSIONS

More terms from Lambert Klasen (lambert.klasen(AT)gmx.net), Nov 06 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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research