login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A047469 Numbers that are congruent to {0, 1, 2} mod 8. 0
0, 1, 2, 8, 9, 10, 16, 17, 18, 24, 25, 26, 32, 33, 34, 40, 41, 42, 48, 49, 50, 56, 57, 58, 64, 65, 66, 72, 73, 74, 80, 81, 82, 88, 89, 90, 96, 97, 98, 104, 105, 106, 112, 113, 114, 120, 121, 122, 128, 129, 130, 136 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

REFERENCES

a(n+1)=Sum_k>=0 {A030341(n,k)*b(k)} with b(0)=1 and b(k)=8*3^(k-1) for k>0. - From DELEHAM Philippe, Oct 24 2011.

FORMULA

G.f.: x(1+x+6x^2)/((1-x)(1-x^3)).

PROG

(PARI) a(n)=n+n\3*5

CROSSREFS

Sequence in context: A175463 A167450 A050569 * A037456 A019511 A103190

Adjacent sequences:  A047466 A047467 A047468 * A047470 A047471 A047472

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 23:53 EST 2012. Contains 205860 sequences.