This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A047440 Numbers that are congruent to {2, 5, 6} mod 8. 1

%I

%S 2,5,6,10,13,14,18,21,22,26,29,30,34,37,38,42,45,46,50,53,54,58,61,62,

%T 66,69,70,74,77,78,82,85,86,90,93,94,98,101,102,106,109,110,114,117,

%U 118,122,125,126,130,133,134,138,141,142,146,149,150,154,157,158

%N Numbers that are congruent to {2, 5, 6} mod 8.

%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,1,-1).

%F G.f.: x*(2+3*x+x^2+2*x^3)/((1+x+x^2)*(x-1)^2). - _R. J. Mathar_, Dec 07 2011

%F a(n) = a(n-1) + a(n-3) - a(n-4) for n>4.

%F a(n) = (24*n-9-9*cos(2*n*Pi/3)-sqrt(3)*sin(2*n*Pi/3))/9.

%F a(3k) = 8k-2, a(3k-1) = 8k-3, a(3k-2) = 8k-6. (End)

%p A047440:=n->(24*n-9-9*cos(2*n*Pi/3)-sqrt(3)*sin(2*n*Pi/3))/9: seq(A047440(n), n=1..100); # _Wesley Ivan Hurt_, Jun 09 2016

%t Flatten[{#+2,#+5,#+6}&/@(8 Range[0,20])] (* _Harvey P. Dale_, Dec. 19, 2010 *)

%o (MAGMA) [n : n in [0..150] | n mod 8 in [2, 5, 6]]; // _Wesley Ivan Hurt_, Jun 09 2016

%K nonn,easy

%O 1,1

%A _N. J. A. Sloane_

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 May 19 02:45 EDT 2019. Contains 323377 sequences. (Running on oeis4.)