Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A061104
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A061104 Smallest number whose digit sum is n^2. +0
4
0, 1, 4, 9, 79, 799, 9999, 499999, 19999999, 999999999, 199999999999, 49999999999999, 9999999999999999, 7999999999999999999, 7999999999999999999999, 9999999999999999999999999 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n) =((n^2 mod 9)+ 1)*10^floor[n^2/9]-1. - Henry Bottomley (se16(AT)btinternet.com), Apr 24 2001

EXAMPLE

a(5) = 799, 7+9+9 = 25 = 5^2.

CROSSREFS

Cf. A051885, A061105.

Adjacent sequences: A061101 A061102 A061103 this_sequence A061105 A061106 A061107

Sequence in context: A100517 A041597 A041030 this_sequence A082381 A077530 A115551

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 20 2001

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 08:31 EDT 2008. Contains 144667 sequences.


AT&T Labs Research