Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101615
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101615 Number of representations of n as a sum of the Jacobsthal numbers A078008 (2 is allowed twice as a part). +0
3
1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 2 (list; graph; listen)
OFFSET

0,3

COMMENT

Partial sums are A101616.

FORMULA

G.f.: Product{k>=0, 1+x^A078008(k)}/2

CROSSREFS

Cf. A026465.

Sequence in context: A099384 A015716 A101598 this_sequence A140193 A073741 A071838

Adjacent sequences: A101612 A101613 A101614 this_sequence A101616 A101617 A101618

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Dec 09 2004

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 30 22:12 EST 2008. Contains 150989 sequences.


AT&T Labs Research