|
Search: id:A096777
|
|
|
| A096777 |
|
a(n) = a(n-1) + Sum(a(k) mod 2: 1<=k<n), a(1) = 1. |
|
+0
8
|
|
| 1, 2, 3, 5, 8, 11, 15, 20, 25, 31, 38, 45, 53, 62, 71, 81, 92, 103, 115, 128, 141, 155, 170, 185, 201, 218, 235, 253, 272, 291, 311, 332, 353, 375, 398, 421, 445, 470, 495, 521, 548, 575, 603, 632, 661, 691, 722, 753, 785, 818, 851, 885, 920, 955, 991, 1028
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
a(n+1) - a(n) = A004396(n).
a(n) = [a(n-1) + (number of odd terms so far in the sequence)]. Example: 15 is [11 + 4 odd terms so far in the sequence (they are 1,3,5,11)]. See A007980 for the same construction with even integers. - Eric Angelini (eric.angelini(AT)kntv.be), Aug 05 2007
A016789 and A032766 give positions where even and odd terms occur; a(3*n)=A056106(n); a(3*n-1)=A077588(n); a(3*n-2)=A056108(n). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 29 2007
|
|
LINKS
|
R. Zumkeller, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Odd Number
|
|
FORMULA
|
a(n) = [n/3] * (3*[n/3] + 2*(n mod 3) - 1) + n mod 3 + 0^(n mod 3). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 29 2007
|
|
CROSSREFS
|
Cf. A131093, A097602.
Sequence in context: A131073 A062485 A137179 this_sequence A125811 A071424 A008762
Adjacent sequences: A096774 A096775 A096776 this_sequence A096778 A096779 A096780
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 09 2004
|
|
|
Search completed in 0.002 seconds
|
