Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A074205
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A074205 Smallest positive integer whose n-th power contains an equal number of each digit (0-9) when represented in base 10. +0
7
1023456789, 32043, 2158479, 69636, 643905, 3470187, 421359, 1472157, 320127, 81785058, 15763347, 31064268, 44626422, 330096453, 85810806, 500282265, 2280602382, 711974055 (list; graph; listen)
OFFSET

1,1

EXAMPLE

643905^5 == 110690152879433875483274690625, which contains 3 of each digit 0-9.

PROGRAM

(PARI) { a(n) = local(k, m, v); k=9; while(1, for(m=ceil(10^(k/n)), floor(10^((k+1)/n)), t=m^n; v=vector(10); while(t, v[(t%10)+1]++; t\=10; ); if(vecmin(v)==vecmax(v), return(m); ); ); k+=10) } [From Max Alekseyev (maxale(AT)gmail.com), May 20 2009]

CROSSREFS

Sequence in context: A048939 A095733 A020666 this_sequence A061604 A050278 A051018

Adjacent sequences: A074202 A074203 A074204 this_sequence A074206 A074207 A074208

KEYWORD

base,more,nonn

AUTHOR

Jack Brennen (jb(AT)brennen.net), Sep 17 2002

EXTENSIONS

a(10)..a(18) from Max Alekseyev (maxale(AT)gmail.com), May 20 2009

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 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research