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.

A036408 a(n) = ceiling(n^2/10).

Original entry on oeis.org

0, 1, 1, 1, 2, 3, 4, 5, 7, 9, 10, 13, 15, 17, 20, 23, 26, 29, 33, 37, 40, 45, 49, 53, 58, 63, 68, 73, 79, 85, 90, 97, 103, 109, 116, 123, 130, 137, 145, 153, 160, 169, 177, 185, 194, 203, 212, 221, 231, 241, 250, 261, 271, 281, 292, 303, 314, 325
Offset: 0

Views

Author

Keywords

Examples

			a(6) = ceiling(6^2/10) = ceiling(3.6) = 4.
		

Programs

Formula

From R. J. Mathar, Jan 22 2011: (Start)
a(n) = 2*a(n-1) - a(n-2) + a(n-10) - 2*a(n-11) + a(n-12).
G.f.: -x*(1 - x + x^7 - x^9 + x^10 + x^3) / ( (1+x)*(x^4 + x^3 + x^2 + x + 1)*(x^4 - x^3 + x^2 - x + 1)*(x-1)^3 ). (End)