Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116940
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116940 Greatest m such that A116939(m) = n. +0
3
0, 3, 6, 11, 16, 23, 30, 39, 48, 59, 70, 83, 96, 111, 126, 143, 160, 179, 198, 219, 240, 263, 286, 311, 336, 363, 390, 419, 448, 479, 510, 543, 576, 611, 646, 683, 720, 759, 798, 839, 880, 923, 966, 1011, 1056, 1103, 1150, 1199, 1248, 1299, 1350, 1403, 1456 (list; graph; listen)
OFFSET

0,2

COMMENT

a(n) = A000982(n) + A005843(n).

FORMULA

a(0) = 0, a(n+1) = a(n) + 2*floor(n/2) + 3.

CROSSREFS

Sequence in context: A030720 A111582 A024401 this_sequence A087099 A075703 A034029

Adjacent sequences: A116937 A116938 A116939 this_sequence A116941 A116942 A116943

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Feb 27 2006

page 1

Search completed in 0.005 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 23 17:35 EDT 2008. Contains 142285 sequences.


AT&T Labs Research