login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A061104 Smallest number whose digit sum is n^2. 4
0, 1, 4, 9, 79, 799, 9999, 499999, 19999999, 999999999, 199999999999, 49999999999999, 9999999999999999, 7999999999999999999, 7999999999999999999999, 9999999999999999999999999 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Harry J. Smith, Table of n, a(n) for n = 0..94

FORMULA

a(n) = ((n^2 mod 9) + 1)*10^floor(n^2/9) - 1. - Henry Bottomley, Apr 24 2001

EXAMPLE

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

PROG

(PARI) { for (n=0, 94, a=(n^2%9 + 1)*10^(n^2\9) - 1; write("b061104.txt", n, " ", a) ) } \\ Harry J. Smith, Jul 18 2009

CROSSREFS

Cf. A051885, A061105.

Sequence in context: A327579 A041597 A041030 * A082381 A155931 A309801

Adjacent sequences:  A061101 A061102 A061103 * A061105 A061106 A061107

KEYWORD

nonn,base

AUTHOR

Amarnath Murthy, Apr 20 2001

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 19 14:56 EDT 2021. Contains 348090 sequences. (Running on oeis4.)