Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084013
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084013 Smallest n-digit palindromic multiple of n. For n = 10k it is sufficient that the multiple is palindromic with leading zeros ignored. 0 if no such number exists. +0
5
1, 22, 111, 2112, 50005, 201102, 1002001, 21100112, 100070001, 1000000010, 10000200001, 400002200004, 1000029200001, 20000055000002, 500000020000005, 2110000000000112, 10000000200000001, 200000007700000002 (list; graph; listen)
OFFSET

1,2

COMMENT

Conjecture: no entry is zero.

CROSSREFS

Cf. A084014, A084015, A084016.

Sequence in context: A124950 A126409 A041938 this_sequence A083123 A084017 A089184

Adjacent sequences: A084010 A084011 A084012 this_sequence A084014 A084015 A084016

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy and Meenakshi Srikanth (amarnath_murthy(AT)yahoo.com), May 23 2003

EXTENSIONS

Corrected and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Jun 08 2003

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research