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.

A086497 Primes arising in A086496. a(n) = Sum {A086946(k), k = 1 to 2n}= 2n-th partial sum of A086496.

Original entry on oeis.org

3, 11, 23, 41, 59, 83, 107, 137, 173, 223, 263, 311, 359, 419, 479, 541, 601, 673, 751, 827, 911, 1009, 1097, 1193, 1289, 1399, 1511, 1621, 1733, 1861, 1973, 2099, 2237, 2377, 2521, 2659, 2797, 2953, 3109, 3257, 3433, 3607, 3779, 3947, 4127, 4327, 4507
Offset: 1

Views

Author

Amarnath Murthy, Jul 28 2003

Keywords

Crossrefs

Extensions

More terms from Ray Chandler, Sep 16 2003

A086949 Numbers k such that R(k+9) = 5.

Original entry on oeis.org

41, 491, 4991, 49991, 499991, 4999991, 49999991, 499999991, 4999999991, 49999999991, 499999999991, 4999999999991, 49999999999991, 499999999999991, 4999999999999991, 49999999999999991, 499999999999999991, 4999999999999999991, 49999999999999999991, 499999999999999999991
Offset: 1

Views

Author

Ray Chandler, Jul 24 2003

Keywords

Crossrefs

Programs

Formula

a(n) = 5*10^n - 9.
R(a(n)) = A086946(n).
From Stefano Spezia, Dec 15 2022: (Start)
O.g.f.: x*(41 + 40*x)/((1 - x)*(1 - 10*x)).
E.g.f.: 4 - 9*exp(x) + 5*exp(10*x).
a(n) = 11*a(n-1) - 10*a(n-2) for n > 2. (End)
Showing 1-2 of 2 results.