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.

Showing 1-2 of 2 results.

A137233 Number of n-digit even numbers.

Original entry on oeis.org

5, 45, 450, 4500, 45000, 450000, 4500000, 45000000, 450000000, 4500000000, 45000000000, 450000000000, 4500000000000, 45000000000000, 450000000000000, 4500000000000000, 45000000000000000, 450000000000000000, 4500000000000000000, 45000000000000000000, 450000000000000000000
Offset: 1

Views

Author

Ctibor O. Zizka, Mar 08 2008

Keywords

Comments

From Kival Ngaokrajang, Oct 18 2013: (Start)
a(n) is also the total number of double rows identified numbers in n digit.
For example:
n = 1: 01 23 45 67 89 = 5 double rows;
n = 2: 1011 1213 1415 1617 1819...9899 = 45 double rows;
n = 3: 100101 102103 104105...998999 = 450 double rows;
The number of double rows is also A030656. (End)
a(n) is also the number of n-digit integers with an even number of even digits (A356929); a(5) = 45000 is the answer to the question 2 of the Olympiade Mathématique Belge in 2004 (link). - Bernard Schott, Sep 06 2022
a(n) is also the number of n-digit integers with an odd number of odd digits (A054684). - Bernard Schott, Nov 07 2022

Examples

			a(2) = 45 because there are 45 2-digit even numbers.
		

Crossrefs

Programs

Formula

a(n) = 9*10^(n-1)/2 if n > 1. - R. J. Mathar, May 23 2008
From Elmo R. Oliveira, Jul 23 2025: (Start)
G.f.: 5*x*(1-x)/(1-10*x).
E.g.f.: (-9 + 10*x + 9*exp(10*x))/20.
a(n) = 10*a(n-1) for n > 2.
a(n) = A052268(n)/2 for n >= 2. (End)

Extensions

Corrected and extended by R. J. Mathar, May 23 2008
More terms from Elmo R. Oliveira, Jul 23 2025

A014917 a(1)=1, a(n) = n*5^(n-1) + a(n-1).

Original entry on oeis.org

1, 11, 86, 586, 3711, 22461, 131836, 756836, 4272461, 23803711, 131225586, 717163086, 3890991211, 20980834961, 112533569336, 600814819336, 3194808959961, 16927719116211, 89406967163086, 470876693725586, 2473592758178711, 12964010238647461, 67800283432006836, 353902578353881836
Offset: 1

Views

Author

Keywords

Comments

From Gary Detlefs, Aug 31 2021 (Start)
This is the x=5 member of the x-family of sequences with member a(x, n) = x^n*Sum_{k=1..n} S(x, k), with S(x, k) = Sum_{j=1..k} 1/x^j.
S(x, k) = (x^k - 1)/((x-1)*x^k) = (1/x^k)*Sum_{j=0..k-1} x^j, and a(x,n) = ((n*(x-1) - 1)*x^n + 1)/(x-1)^2.
The sequence {x^k*S(x, k)} with recurrence signature (x+1, -x) leads to sequence {a(x, n)} with recurrence signature (2*x+1, -x*(x+2), x^2). (End) [Rewritten by Wolfdieter Lang, Nov 30 2021]

Crossrefs

Programs

  • Magma
    I:=[1, 11]; [n le 2 select I[n] else 10*Self(n-1)-25*Self(n-2)+ 1: n in [1..30]]; // Vincenzo Librandi, Oct 23 2012
  • Mathematica
    CoefficientList[Series[1/((1 - x)(1 - 5 x)^2), {x, 0, 40}], x] (* Vincenzo Librandi, Oct 23 2012 *)
    LinearRecurrence[{11,-35,25},{1,11,86},20] (* Harvey P. Dale, May 06 2013 *)

Formula

From Vincenzo Librandi, Oct 23 2012: (Start)
a(n) = 10*a(n-1) - 25*a(n-2) + 1; a(1)=1, a(2)=11.
G.f.: x/((1-x)*(1-5*x)^2). (End)
a(n) = 11*a(n-1) - 35*a(n-2) + 25*a(n-3); a(1)=1, a(2)=11, a(3)=86. - Harvey P. Dale, May 06 2013
a(n) = 5^n*Sum_{k=1..n} (Sum_{j=1..k} 1/x^j) = ((4*n - 1)*5^n + 1)/4^2. See the general comment above, and the first formula. - Gary Detlefs, Aug 31 2021 [Edited by Wolfdieter Lang, Nov 30 2021]
E.g.f.: exp(x)*(1 + exp(4*x)*(20*x - 1))/16. - Elmo R. Oliveira, May 24 2025
Showing 1-2 of 2 results.