cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A185076 a(n) is the least number k such that (sum of digits of k^2) + (number of digits of k^2) = n, or 0 if no such k exists.

Table of values

n a(n)
1 0
2 1
3 0
4 10
5 2
6 100
7 11
8 1000
9 4
10 3
11 6
12 8
13 19
14 35
15 7
16 16
17 34
18 106
19 13
20 41
21 24
22 17
23 37
24 107
25 323
26 43
27 124
28 317
29 67
30 113
31 63
32 114
33 134
34 343
35 83
36 133
37 367
38 1024
39 167
40 374
41 264
42 314
43 386
44 1043
45 313
46 583
47 1303
48 3283
49 707
50 1183
51 3316
52 836
53 1333
54 3286
55 10133

List of values

[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]