|
Search: id:A047400
|
|
|
| A047400 |
|
Numbers that are congruent to {1, 3, 6} mod 8. |
|
+0
1
|
|
| 1, 3, 6, 9, 11, 14, 17, 19, 22, 25, 27, 30, 33, 35, 38, 41, 43, 46, 49, 51, 54, 57, 59, 62, 65, 67, 70, 73, 75, 78, 81, 83, 86, 89, 91, 94, 97, 99, 102, 105, 107, 110, 113, 115, 118, 121, 123, 126, 129, 131, 134, 137
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
Sum of paired terms of A004773, numbers congruent to {0,1,2} mod 4; such that A047400(n) = A004773(n) + A004773(n+1). - Gary W. Adamson (qntmpkt(AT)yahoo.com), Sep 13 2007
a(n)=(1/9)*{25*(n mod 3)+[(n+1) mod 3]+4*[(n+2) mod 3]} + 8*A002264 - Paolo P. Lava (ppl(AT)spl.at), Nov 05 2007
Union of A017077, A017101 and A017137. O.g.f.: x(1+x)(2x^2+x+1)/[(-1+x)^2*(x^2+x+1)]. a(n)=a(n-3)+8. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 14 2008
|
|
PROGRAM
|
(PARI) a(n) = {x=8*floor((n-1)/3); if(n%3==1, x=x+1); if(n%3==2, x=x+3); if(n%3==0, x=x+6); x} [From Michael Porter (michael_b_porter(AT)yahoo.com), Oct 02 2009]
|
|
CROSSREFS
|
Cf. A004773.
Sequence in context: A086883 A154777 A094740 this_sequence A054414 A136616 A121384
Adjacent sequences: A047397 A047398 A047399 this_sequence A047401 A047402 A047403
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
