Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125304
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125304 a(n) is the smallest number such that its n power has all its digits twice. +0
1
11, 88, 11, 207, 2955 (list; graph; listen)
OFFSET

1,1

COMMENT

There may be no further terms.

EXAMPLE

11^1 = 11, 88^2 = 7744, 11^3 = 1331, 207^4 = 1836036801, 2955^5 = 225313610074846875

MATHEMATICA

g[n_] := Block[{k = 2}, While[ Union[ Length@ # & /@ Split@ Sort@ IntegerDigits[k^n]] != {2}, k++ ]; k]; Do[ Print@ g@ n, {n, 5}] (* Robert G. Wilson v (rgwv@rgwv.com), Aug 31 2007 *)

CROSSREFS

Sequence in context: A081013 A119383 A001278 this_sequence A022735 A037601 A037706

Adjacent sequences: A125301 A125302 A125303 this_sequence A125305 A125306 A125307

KEYWORD

base,fini,nonn

AUTHOR

Tanya Khovanova (tanyakh(AT)yahoo.com), Dec 09 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 September 6 09:40 EDT 2008. Contains 143480 sequences.


AT&T Labs Research