Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131205
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131205 a(n) = a(n-1) + a(floor(n/2)) + a(ceiling(n/2)). +0
1
1, 3, 7, 13, 23, 37, 57, 83, 119, 165, 225, 299, 393, 507, 647, 813, 1015, 1253, 1537, 1867, 2257, 2707, 3231, 3829, 4521, 5307, 6207, 7221, 8375, 9669, 11129, 12755, 14583, 16613, 18881, 21387, 24177, 27251, 30655, 34389, 38513, 43027, 47991 (list; graph; listen)
OFFSET

1,2

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

FORMULA

Partial sums of A000123: (1, 2, 4, 6, 10, 14, 20, 26,...). - Gary W. Adamson (qntmpkt(AT)yahoo.com), Oct 26 2007

CROSSREFS

Cf. A033485, A000123.

Cf. A131205.

Adjacent sequences: A131202 A131203 A131204 this_sequence A131206 A131207 A131208

Sequence in context: A101301 A103116 A075321 this_sequence A058682 A081995 A053599

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 22 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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research