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!)
A067072 a(n) = smallest square m^2 such that the sum of the digits of m^2 is equal to n^2. 4
0, 1, 4, 9, 169, 4489, 69696, 2778889, 277788889, 8998988769, 2699997789889, 898999897988929, 498999778899898896, 969988797999759789889, 1679898987989978888999689 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..14.

FORMULA

a(n) = A061912(n)^2.

EXAMPLE

a(5) = 4489 = 67^2 as it is the smallest square whose digit sum = 25 = 5^2.

CROSSREFS

Cf. A061912, A067074.

Sequence in context: A306739 A318616 A029738 * A080438 A029999 A006280

Adjacent sequences:  A067069 A067070 A067071 * A067073 A067074 A067075

KEYWORD

nonn,base

AUTHOR

Amarnath Murthy, Jan 05 2002

EXTENSIONS

More terms from Jason Earls, Jan 09 2002

a(11)-a(14) from Donovan Johnson, Jul 10 2012

a(0)=0 prepended by Seiichi Manyama, Aug 12 2017

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 November 28 13:47 EST 2021. Contains 349413 sequences. (Running on oeis4.)