Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115942
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A115942 a(n) is the least k such that 2^k contains a palindromic substring of length n. +0
2
0, 16, 17, 41, 43, 41, 76, 274, 76, 468 (list; graph; listen)
OFFSET

1,2

EXAMPLE

a(6)=41 since the first palindromic substring of length 6

appears in 2^41=2199023(255552).

CROSSREFS

Cf. A115943.

Sequence in context: A070869 A101196 A064637 this_sequence A052059 A041526 A041524

Adjacent sequences: A115939 A115940 A115941 this_sequence A115943 A115944 A115945

KEYWORD

nonn,base

AUTHOR

Giovanni Resta (g.resta(AT)iit.cnr.it), Feb 06 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research