Greetings from
The On-Line Encyclopedia of Integer Sequences
!
Hints
Search:
id:A124245
Displaying 1-1 of 1 results found.
page 1
Format:
long
| short |
internal
|
text
Sort: relevance |
references
|
number
Highlight: on |
off
A124245
a(n) is the smallest odd number m such that 2^n*m has n digits but has at most two distinct digits.
+0
2
1, 3, 25, 101, 363, 3125, 15625, 71023, 390625, 1183713, 5474669, 27151397, 135646011, 1220703125, 6103515625, 18480090517, 85533990571, 762939453125, 3814697265625, 11550150977337, 53458791308981, 265147974756053
(
list
;
graph
;
listen
)
page 1
Search completed in 0.003 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 16 13:01 EST 2009. Contains 170825 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
