This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A047525 Numbers that are congruent to {0, 2, 7} mod 8. 1
 0, 2, 7, 8, 10, 15, 16, 18, 23, 24, 26, 31, 32, 34, 39, 40, 42, 47, 48, 50, 55, 56, 58, 63, 64, 66, 71, 72, 74, 79, 80, 82, 87, 88, 90, 95, 96, 98, 103, 104, 106, 111, 112, 114, 119, 120, 122, 127, 128, 130, 135, 136, 138, 143, 144, 146, 151, 152 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..1000 Index entries for linear recurrences with constant coefficients, signature (1,0,1,-1). FORMULA From Chai Wah Wu, May 28 2016: (Start) a(n) = a(n-1) + a(n-3) - a(n-4) for n>4. G.f.: x^2*(x^2 + 5*x + 2)/(x^4 - x^3 - x + 1). (End) a(n) = (24*n + 2*sqrt(3)*sin(2*Pi*n/3) + 12*cos(2*Pi*n/3) - 21)/9. - Ilya Gutkovskiy, May 29 2016 a(3k) = 8k-1, a(3k-1) = 8k-6, a(3k-2) = 8k-8. - Wesley Ivan Hurt, Jun 10 2016 MAPLE A047525:=n->(24*n+2*sqrt(3)*sin(2*Pi*n/3)+12*cos(2*Pi*n/3)-21)/9: seq(A047525(n), n=1..100); # Wesley Ivan Hurt, Jun 10 2016 MATHEMATICA Flatten[# + {0, 2, 7} &/@(8 Range[0, 30])] (* Vincenzo Librandi, May 29 2016 *) PROG (MAGMA) [n: n in [0..200] | n mod 8 in [0, 2, 7]]; // Vincenzo Librandi, May 29 2016 CROSSREFS Sequence in context: A243167 A039005 A022431 * A075766 A258823 A226612 Adjacent sequences:  A047522 A047523 A047524 * A047526 A047527 A047528 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 23 21:25 EDT 2019. Contains 322388 sequences. (Running on oeis4.)