Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A156537
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A156537 a(n), a(n+1), a(n+2), for n=2,5,8,11,... are respectively the numbers of representations of the integers 2^k-2, 2^k, 2^k+2, where k=(n+4)/3, by unordered sums of two numbers of A156284 +0
6
0, 0, 1, 1, 0, 1, 2, 0, 1, 2, 0, 3, 3, 0, 2, 5, 0, 4, 6, 0, 9, 19, 0, 8, 11, 0, 23, 51, 0, 27, 44, 0, 70, 207, 0, 80, 92, 0, 217, 399, 0, 279, 444, 0, 685, 1653, 0, 630, 1010, 0, 2137, 4893, 0, 3068, 3683, 0, 6855 (list; graph; listen)
OFFSET

2,7

COMMENT

According to the construction of A156284, a_(3n)=0, n>=1. These terms may be called "wells". The growth of the depth of the "wells" is O(2^(n/3)ln(n)/n^2).

CROSSREFS

Cf. A156284 A002375

Sequence in context: A025666 A025679 A071491 this_sequence A145316 A137298 A136487

Adjacent sequences: A156534 A156535 A156536 this_sequence A156538 A156539 A156540

KEYWORD

nonn

AUTHOR

Vladimir Shevelev (shevelev(AT)bgu.ac.il), Feb 09 2009, Feb 14, 2009

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com), Feb 14 2009

I added some terms Vladimir Shevelev (shevelev(AT)bgu.ac.il), Mar 19 2009

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research