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.

A008592 Multiples of 10: a(n) = 10*n.

Original entry on oeis.org

0, 10, 20, 30, 40, 50, 60, 70, 80, 90, 100, 110, 120, 130, 140, 150, 160, 170, 180, 190, 200, 210, 220, 230, 240, 250, 260, 270, 280, 290, 300, 310, 320, 330, 340, 350, 360, 370, 380, 390, 400, 410, 420, 430, 440, 450, 460, 470, 480, 490, 500, 510, 520, 530
Offset: 0

Views

Author

Keywords

Comments

Number of 3 X n binary matrices avoiding simultaneously the right angled numbered polyomino patterns (ranpp) (00;1), (01,1) and (11;0). An occurrence of a ranpp (xy;z) in a matrix A=(a(i,j)) is a triple (a(i1,j1), a(i1,j2), a(i2,j1)) where i11 and n>1. - Sergey Kitaev, Nov 12 2004
If Y is a 5-subset of an n-set X then, for n>=5, a(n-4) is the number of 3-subsets of X having at least two elements in common with Y. - Milan Janjic, Dec 08 2007
Complement of A067251; A168184(a(n)) = 0. - Reinhard Zumkeller, Nov 30 2009
Where record values occur for the number of partitions of n into powers of 10: A179052(n) = A179051(a(n)). - Reinhard Zumkeller, Jun 27 2010
Numbers ending in 0. - Wesley Ivan Hurt, Apr 10 2016

Crossrefs

Programs

Formula

From Vincenzo Librandi, Dec 24 2010: (Start)
G.f.: 10*x/(x-1)^2.
a(n) = 2*a(n-1) - a(n-2) for n > 1. (End)
a(n) = Sum_{i=2n-2..2n+2} i. - Wesley Ivan Hurt, Apr 11 2016
E.g.f.: 10*x*exp(x). - Stefano Spezia, May 31 2021