login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A050432 Length of longest palindromic subword of (n base 4). 1
1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 3, 1, 1, 2, 3, 2, 2, 1, 3, 2, 1, 1, 3, 1, 2, 2, 1, 3, 1, 1, 2, 3, 1, 2, 2, 3, 2, 1, 1, 3, 2, 2, 1, 1, 3, 1, 2, 1, 3, 1, 1, 2, 3, 2, 2, 2, 3, 3, 4, 2, 2, 3, 3, 3, 3, 3, 1, 2, 1, 3, 1, 1, 2, 2, 3, 2, 2, 3, 4, 3, 3, 2, 3, 2 (list; graph; refs; listen; history; internal format)
OFFSET

1,5

FORMULA

a(n) <= min(a(4*n+k): 0 <= k < 4). [Reinhard Zumkeller, Jul 31 2011]

CROSSREFS

Sequence in context: A043278 A125238 A025896 * A030346 A030336 A205007

Adjacent sequences:  A050429 A050430 A050431 * A050433 A050434 A050435

KEYWORD

nonn,base

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 20:26 EST 2012. Contains 205852 sequences.