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!)
A166304 Third trisection of A022998. 5

%I #10 Mar 03 2024 15:43:54

%S 4,5,16,11,28,17,40,23,52,29,64,35,76,41,88,47,100,53,112,59,124,65,

%T 136,71,148,77,160,83,172,89,184,95,196,101,208,107,220,113,232,119,

%U 244,125,256,131,268,137,280,143,292,149,304,155,316,161,328,167,340,173,352,179

%N Third trisection of A022998.

%C The sequence read modulo 9 is the periodic sequence 4, 5, 7, 2, 1, 8 (repeat..)

%C The same set of numbers in a period of length 6 is in A153130,

%C A165355 read modulo 9, A165367 read modulo 9, and A166138 read modulo 9.

%H G. C. Greubel, <a href="/A166304/b166304.txt">Table of n, a(n) for n = 0..10000</a>

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

%F a(n) = A022998(3*n+2).

%F a(n) = 2*a(n-2)-a(n-4).

%F G.f.: (4+5*x+8*x^2+x^3)/((x-1)^2 *(1+x)^2 ).

%F a(2*n) = A017569(n). a(2n+1) = A016969(n) .

%t LinearRecurrence[{0, 2, 0, -1}, {4, 5, 16, 11}, 100] (* _G. C. Greubel_, May 09 2016 *)

%Y Cf. A165988 (first trisection), A166138 (2nd trisection).

%K nonn,easy

%O 0,1

%A _Paul Curtz_, Oct 11 2009

%E Edited and extended by _R. J. Mathar_, Oct 14 2009

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 25 12:15 EDT 2024. Contains 371969 sequences. (Running on oeis4.)