login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A185076 Least number k such that n = sum of digits of k^2 + number digits of k^2, or 0 if no such k exists. 0
0, 1, 0, 10, 2, 100, 11, 1000, 4, 3, 6, 8, 19, 35, 7, 16, 34, 106, 13, 41, 24, 17, 37, 107, 323, 43, 124, 317, 67, 113, 63, 114, 134, 343, 83, 133, 367, 1024, 167, 374, 264, 314, 386, 1043, 313, 583, 1303, 3283, 707, 1183, 3316, 836, 1333, 3286, 10133 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Table of n, a(n) for n=1..55.

FORMULA

n = A004159(a(n)) + A185679(a(n)).

EXAMPLE

a(7)=11 since 7 = sumdigits(121) + numberdigits(121) = 4 + 3.

MATHEMATICA

Table[k=1; While[d=IntegerDigits[k^2]; n>Length[d] && n != Total[d] + Length[d], k++]; If[Length[d] >= n, k=0]; k, {n, 50}]

CROSSREFS

Cf. A004159.

Sequence in context: A096043 A001202 A054841 * A178643 A038304 A290308

Adjacent sequences:  A185073 A185074 A185075 * A185077 A185078 A185079

KEYWORD

nonn,base

AUTHOR

Carmine Suriano, Feb 23 2011

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 May 23 18:45 EDT 2019. Contains 323528 sequences. (Running on oeis4.)