login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A047402 Numbers that are congruent to {2, 3, 6} mod 8. 1
2, 3, 6, 10, 11, 14, 18, 19, 22, 26, 27, 30, 34, 35, 38, 42, 43, 46, 50, 51, 54, 58, 59, 62, 66, 67, 70, 74, 75, 78, 82, 83, 86, 90, 91, 94, 98, 99, 102, 106, 107, 110, 114, 115, 118, 122, 123, 126, 130, 131, 134, 138, 139, 142, 146, 147, 150, 154, 155, 158 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
a(n) = a(n-3) + 8. - Herman Jamke (hermanjamke(AT)fastmail.fm), Sep 14 2006
G.f.: x*(2+x+3*x^2+2*x^3)/((1+x+x^2)*(x-1)^2). - R. J. Mathar, Jul 08 2011
From Wesley Ivan Hurt, Jun 09 2016: (Start)
a(n) = a(n-1) + a(n-3) - a(n-4) for n>4.
a(n) = (24*n - 15 - 3*cos(2*n*Pi/3) + 5*sqrt(3)*sin(2*n*Pi/3))/9.
a(3k) = 8k-2, a(3k-1) = 8k-5, a(3k-2) = 8k-6. (End)
MAPLE
A047402:=n->(24*n-15-3*cos(2*n*Pi/3)+5*sqrt(3)*sin(2*n*Pi/3))/9: seq(A047402(n), n=1..100); # Wesley Ivan Hurt, Jun 09 2016
MATHEMATICA
Flatten[#+{2, 3, 6}&/@(8Range[0, 20])] (* or *) LinearRecurrence[{1, 0, 1, -1}, {2, 3, 6, 10}, 70] (* Harvey P. Dale, Nov 03 2013 *)
PROG
(Magma) [n : n in [0..150] | n mod 8 in [2, 3, 6]]; // Wesley Ivan Hurt, Jun 09 2016
CROSSREFS
Sequence in context: A048633 A225175 A286954 * A088196 A112925 A193246
KEYWORD
nonn,easy
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)