Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110815
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A110815 Least n-digit number m such that its square uses only digits not appearing in m. +0
3
2, 17, 144, 1447, 14144, 141494, 1414414, 14144134, 141431114, 1414411113, 14143143413, 141431113114, 1414311131114, 14143111141813, 141431113114113, 1414311344113314, 14143111141141113, 141431113114331413 (list; graph; listen)
OFFSET

1,1

COMMENT

floor(sqrt(2)*10^(n-1))<a(n). - Robert G. Wilson v (rgwv(at)rgwv.com), Oct 04 2005

EXAMPLE

f[n_] := Block[{k = Ceiling[10^n*(1/9 + .03032)]}, While[ Intersection[ IntegerDigits[k], IntegerDigits[k^2]] != {}, k++ ]; k]; Table[ f[n], {n, 18}] (* Robert G. Wilson v *)

CROSSREFS

Cf. A110816 (corresponding squares), A112321. Subsequence of A029783.

Sequence in context: A037741 A037636 A163066 this_sequence A074624 A126037 A112321

Adjacent sequences: A110812 A110813 A110814 this_sequence A110816 A110817 A110818

KEYWORD

nonn,base

AUTHOR

Lekraj Beedassy (blekraj(AT)yahoo.com), Aug 17 2005

EXTENSIONS

a(3) to a(6) corrected, a(7) to a(13) from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Aug 31 2005. Revised Sep 09 2005.

a(14)-a(18) from Robert G. Wilson v (rgwv(at)rgwv.com), Oct 04 2005

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research