|
Search: id:A042963
|
|
|
| A042963 |
|
Congruent to 1 or 2 mod 4. |
|
+0
10
|
|
| 1, 2, 5, 6, 9, 10, 13, 14, 17, 18, 21, 22, 25, 26, 29, 30, 33, 34, 37, 38, 41, 42, 45, 46, 49, 50, 53, 54, 57, 58, 61, 62, 65, 66, 69, 70, 73, 74, 77, 78, 81, 82, 85, 86, 89, 90, 93, 94, 97, 98, 101, 102, 105, 106, 109
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
A014493(n+1) = A000217(a(n)); complement of A014601. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 04 2004
Equals partial sums of A153284: (1, 1, 3, 1, 3, 1, 3,...) [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Jan 03 2009]
|
|
FORMULA
|
G.f.: (1+x+2*x^2)/((1-x)*(1-x^2)). a(n)=a(n-1)+2+(-1)^n, a(0)=1 - Michael Somos, Jan 12 2000.
a(n)=sum{k=0..n, mod(A001045(k), 4) } - Paul Barry (pbarry(AT)wit.ie), Mar 12 2004
a(n)=A005843(n)+A059841(n) . [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Mar 31 2009]
a(n)=4*n-a(n-1)-5 (with a(1)=1) [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Nov 21 2009]
|
|
EXAMPLE
|
For n=2, a(2)=4*2-1-5=2; n=3, a(3)=4*3-2-5=5; n=4, a(4)=4*4-5-5=6 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Nov 21 2009]
|
|
PROGRAM
|
(PARI) a(n)=1+2*n-n%2
|
|
CROSSREFS
|
A042963(n)=1+A042948(n).
A153284 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Jan 03 2009]
Sequence in context: A031461 A085183 A133759 this_sequence A166097 A000277 A003664
Adjacent sequences: A042960 A042961 A042962 this_sequence A042964 A042965 A042966
|
|
KEYWORD
|
nonn,new
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
