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.

A238843 Smallest number m such that u + (sum of base-9 digits of u) = m has exactly n solutions.

Table of values

n a(n)
1 0
2 10
3 82
4 740
5 282429536492
6 109418989131512359292
7 193632597890512706847971583764083347958511186984324587565465147107798425867049291402906445603076812

List of values

[0, 10, 82, 740, 282429536492, 109418989131512359292, 193632597890512706847971583764083347958511186984324587565465147107798425867049291402906445603076812]