Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A126613
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A126613 a(1)=1. a(n) = a(n-1) + (number of terms, from among terms a(1) through a(n-1), which are powers of primes {including 1}). +0
1
1, 2, 4, 7, 11, 16, 22, 28, 34, 40, 46, 52, 58, 64, 71, 79, 88, 97, 107, 118, 129, 140, 151, 163, 176, 189, 202, 215, 228, 241, 255, 269, 284, 299, 314, 329, 344, 359, 375, 391, 407, 423, 439, 456, 473, 490, 507, 524, 541, 559, 577, 596, 615, 634, 653, 673, 694 (list; graph; listen)
OFFSET

1,2

EXAMPLE

There are 7 prime powers (1,2,4,7,11,16,64) among the first 14 terms of the sequence. So a(15) = a(14) + 7 = 71.

MATHEMATICA

a = {1}; Do[AppendTo[a, a[[ -1]] + 1 + Length[Select[a, Length[FactorInteger[ # ]] == 1 &]]], {60}]; a - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Oct 16 2007

CROSSREFS

Cf. A131073.

Sequence in context: A083204 A061784 A005311 this_sequence A024224 A025727 A025702

Adjacent sequences: A126610 A126611 A126612 this_sequence A126614 A126615 A126616

KEYWORD

nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Jun 13 2007

EXTENSIONS

More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Oct 16 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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research