Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069668
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069668 Largest nontrivial (No trailing zeros) n-digit square with minimum digit sum. +0
5
1, 25, 121, 2401, 10201, 301401, 1002001, 25010001, 100020001, 2500100001, 10000200001, 250001000001, 1000002000001, 25000010000001, 100000020000001, 2500000100000001, 10000000200000001, 250000001000000001 (list; graph; listen)
OFFSET

1,2

COMMENT

The condition not divisible by 10 perhaps is redundant.

CROSSREFS

Cf. A069661, A069662, A069663, A069664, A069665, A069666.

Adjacent sequences: A069665 A069666 A069667 this_sequence A069669 A069670 A069671

Sequence in context: A090159 A025283 A076433 this_sequence A085692 A087399 A030081

KEYWORD

nonn,base

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 06 2002

EXTENSIONS

Corrected and extended by Larry Reeves (larryr(AT)acm.org), Oct 15 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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research