Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A046260
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A046260 Largest palindromic substring in 2^n. +0
3
1, 2, 4, 8, 6, 3, 6, 8, 6, 5, 4, 8, 9, 9, 8, 8, 55, 131, 262, 242, 8, 9, 9, 838, 777, 55, 88, 77, 545, 9, 737, 474, 949, 858, 717, 383, 767, 9, 77, 888, 777, 255552, 111, 222, 444, 888, 77, 3553, 767, 21312, 42624, 99, 737, 474, 9, 797, 575, 8558, 7117, 646, 606, 939 (list; graph; listen)
OFFSET

0,2

EXAMPLE

2^41 = 2199023{255552}.

CROSSREFS

Cf. A047813, A046268.

Sequence in context: A011180 A103546 A080868 this_sequence A086354 A014257 A138284

Adjacent sequences: A046257 A046258 A046259 this_sequence A046261 A046262 A046263

KEYWORD

nonn,base,easy

AUTHOR

Patrick De Geest (pdg(AT)worldofnumbers.com), Jun 15 1998.

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 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research