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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A308659 a(1)=1; for n > 1, a(n) is the length of the longest palindromic suffix of (a(1), ..., a(n-1)). 0
 1, 1, 2, 1, 3, 1, 3, 3, 2, 1, 1, 2, 4, 1, 1, 2, 1, 3, 1, 3, 3, 2, 1, 1, 2, 4, 1, 1, 2, 1, 3, 1, 3, 3, 2, 1, 1, 2, 4, 1, 1, 2, 1, 3, 1, 3, 3, 2, 1, 1, 2, 4, 1, 1, 2, 1, 3, 1, 3, 3, 2, 1, 1, 2, 4, 1, 1, 2, 1, 3, 1, 3, 3, 2, 1, 1, 2, 4, 1, 1, 2, 1, 3, 1, 3, 3, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS The sequence repeats after 13 terms. LINKS Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,0,0,0,0,0,0,0,1). FORMULA G.f.: (1 + x + 2*x^2 + x^3 + 3*x^4 + x^5 + 3*x^6 + 3*x^7 + 2*x^8 + x^9 + x^10 + 2*x^11 + 4*x^12)/(1 - x^13). - Stefano Spezia, Jul 21 2019 EXAMPLE 1   [1], 1   [1 , 1], 2    1 , 1 ,[2], 1    1 ,[1 , 2 , 1], 3    1 , 1 , 2 , 1 ,[3], 1    1 , 1 , 2 ,[1 , 3 , 1], 3    1 , 1 , 2 , 1 ,[3 , 1 , 3], 3    1 , 1 , 2 , 1 , 3 , 1 ,[3 , 3], 2    1 , 1 , 2 , 1 , 3 , 1 , 3 , 3 ,[2], 1    1 , 1 , 2 , 1 , 3 , 1 , 3 , 3 , 2 ,[1], 1    1 , 1 , 2 , 1 , 3 , 1 , 3 , 3 , 2 ,[1 , 1], 2    1 , 1 , 2 , 1 , 3 , 1 , 3 , 3 ,[2 , 1 , 1 , 2], 4 CROSSREFS Cf. A220080. Sequence in context: A003139 A349918 A244797 * A145652 A111248 A100714 Adjacent sequences:  A308656 A308657 A308658 * A308660 A308661 A308662 KEYWORD nonn AUTHOR Samuel B. Reid, Jun 15 2019 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.

Last modified August 10 13:12 EDT 2022. Contains 356039 sequences. (Running on oeis4.)