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.

A218470 Partial sums of floor(n/9).

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 30, 33, 36, 39, 42, 45, 48, 51, 54, 58, 62, 66, 70, 74, 78, 82, 86, 90, 95, 100, 105, 110, 115, 120, 125, 130, 135, 141, 147, 153, 159, 165, 171, 177, 183, 189, 196, 203, 210, 217, 224
Offset: 0

Views

Author

Philippe Deléham, Mar 26 2013

Keywords

Comments

Apart from the initial zeros, the same as A008727.

Examples

			As square array:
..0....0....0....0....0....0....0....0....0....
..1....2....3....4....5....6....7....8....9....
.11...13...15...17...19...21...23...25...27....
.30...33...36...39...42...45...48...51...54....
.58...62...66...70...74...78...82...86...90....
.95..100..105..110..115..120..125..130..135....
141..147..153..159..165..171..177..183..189....
196..203..210..217..224..231..238..245..252....
...
		

Crossrefs

Cf. similar sequences: A118729, A174109, A174738.

Programs

Formula

a(9n) = A051682(n).
a(9n+1) = A062708(n).
a(9n+2) = A062741(n).
a(9n+3) = A022266(n).
a(9n+4) = A022267(n).
a(9n+5) = A081266(n).
a(9n+6) = A062725(n).
a(9n+7) = A062728(n).
a(9n+8) = A027468(n).
G.f.: x^9/((1-x)^2*(1-x^9)). - Bruno Berselli, Mar 27 2013