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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035531 a(n) = A000120(n) + A001221(n) - 1. 0
0, 1, 2, 1, 2, 3, 3, 1, 2, 3, 3, 3, 3, 4, 5, 1, 2, 3, 3, 3, 4, 4, 4, 3, 3, 4, 4, 4, 4, 6, 5, 1, 3, 3, 4, 3, 3, 4, 5, 3, 3, 5, 4, 4, 5, 5, 5, 3, 3, 4, 5, 4, 4, 5, 6, 4, 5, 5, 5, 6, 5, 6, 7, 1, 3, 4, 3, 3, 4, 5, 4, 3, 3, 4, 5, 4, 5, 6, 5, 3, 3, 4, 4, 5, 5, 5, 6, 4, 4, 6, 6, 5, 6, 6, 7, 3, 3, 4, 5, 4, 4, 6, 5, 4, 6, 5, 5, 5, 5, 7, 7 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

FORMULA

G.f.: Sum a(n) x^n = Sum A000120(p)*x^p/(1-x^p), p = prime.

CROSSREFS

Sequence in context: A136624 A033763 A033803 * A118977 A071766 A007305

Adjacent sequences:  A035528 A035529 A035530 * A035532 A035533 A035534

KEYWORD

nonn,easy

AUTHOR

Daniele Parisse (daniele.parisse(AT)m.dasa.de)

EXTENSIONS

More terms from David W. Wilson (davidwwilson(AT)comcast.net).

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 15 17:13 EST 2012. Contains 205828 sequences.