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-4 of 4 results.

A048904 Indices of heptagonal numbers (A000566) which are also octagonal.

Original entry on oeis.org

1, 345, 166145, 80081401, 38599068993, 18604671173081, 8967412906355905, 4322274416192372985, 2083327301191817422721, 1004159436900039805378393, 484002765258517994374962561, 233288328695168773248926575865
Offset: 1

Views

Author

Eric W. Weisstein

Keywords

Comments

As n increases, this sequence is approximately geometric with common ratio r = lim_{n->infinity} a(n)/a(n-1) = (sqrt(5) + sqrt(6))^4 = 241 + 44*sqrt(30). - Ant King, Dec 30 2011

Links

Crossrefs

Cf. A048905, A048906.

Programs

  • Magma
    I:=[1, 345, 166145]; [n le 3 select I[n] else 483*Self(n-1)-483*Self(n-2)+Self(n-3): n in [1..20]]; // Vincenzo Librandi, Dec 28 2011
  • Mathematica
    LinearRecurrence[{483,-483,1},{1,345,166145},30]

Formula

G.f.: x*(-1 + 138*x + 7*x^2) / ( (x-1)*(x^2 - 482*x + 1) ). - R. J. Mathar, Dec 21 2011
From Ant King, Dec 30 2011: (Start)
a(n) = 482*a(n-1) - a(n-2) - 144.
a(n) = (1/60)*((3*sqrt(5) + sqrt(6))*(sqrt(5) + sqrt(6))^(4*n-3) + (3*sqrt(5) - sqrt(6))*(sqrt(5) - sqrt(6))^(4*n-3) + 18).
a(n) = ceiling((1/60)*(3*sqrt(5) + sqrt(6))*(sqrt(5) + sqrt(6))^(4*n-3)). (End)

A048905 Indices of octagonal numbers which are also heptagonal.

Original entry on oeis.org

1, 315, 151669, 73103983, 35235967977, 16983663460771, 8186090552123485, 3945678662460058839, 1901808929215196236753, 916667958203062126055947, 441832054044946729562729541, 212962133381706120587109582655, 102647306457928305176257256110009
Offset: 1

Views

Author

Eric W. Weisstein

Keywords

Comments

As n increases, this sequence is approximately geometric with common ratio r = lim_{n->oo} a(n)/a(n-1) = (sqrt(5)+sqrt(6))^4 = 241+44*sqrt(30). - Ant King, Dec 30 2011

Links

Crossrefs

Cf. A048904, A048906.

Programs

  • Mathematica
    LinearRecurrence[{483,-483,1},{1,315,151669},20] (* Vincenzo Librandi, Dec 28 2011 *)

Formula

G.f.: -x*(1-168*x+7*x^2) / ( (x-1)*(x^2-482*x+1) ). - R. J. Mathar, Dec 21 2011
From Ant King, Dec 30 2011: (Start)
a(n) = 482*a(n-1)-a(n-2)-160.
a(n) = 1/120*((2*sqrt(5)+5*sqrt(6))*(sqrt(5)+sqrt(6))^(4*n-3) + (2*sqrt(5)-5*sqrt(6))*(sqrt(5)-sqrt(6))^(4*n-3)+40).
a(n) = ceiling(1/120*(2*sqrt(5)+5*sqrt(6))*(sqrt(5)+sqrt(6))^(4*n-3)). (End)

A342300 Least nonnegative number greater than the previous number which is simultaneously an n-gonal and (n+1)-gonal number.

Original entry on oeis.org

0, 1, 3, 36, 9801, 40755, 121771, 297045, 631125, 1212751, 2158695, 3617601, 5773825, 8851275, 13117251, 18886285, 26523981, 36450855, 49146175, 65151801, 85076025, 109597411, 139468635, 175520325, 218664901, 269900415, 330314391, 401087665, 483498225, 578925051, 688851955, 814871421
Offset: 0

Views

Author

Robert G. Wilson v, Jun 04 2021

Keywords

Comments

Also the least nontrivial number simultaneously an n and (n+1)-gonal number for n greater than one.
0 and 1 are always terms of any sequence of polygonal numbers of a particular rank beginning with index 0.
Since the formula for the k-th n-gonal number P(n,k) is k*(4+k*(n-2)-n)/2, one can extrapolate for the non-geometrical terms 0, 1 and 2.
Indices of the n and (n+1)-gonal numbers by pairs: {0, 0} {1, 1}, {3, 2}, {8, 6}, {99, 81}, {165, 143}, {247, 221}, {345, 315}, {459, 425}, {589, 551}, {735, 693}, {897, 851} ..., .
{x, y} of the above are {8n^2 + 10n - 3, 8n^2 - 10n - 7} for n>3 (A303295).
In the first 1000 terms, 1 is congruent to 0 (mod 6), 333 are congruent to 1 (mod 6), and 666 are congruent to 3 (mod 6).

Examples

			a(3) is the least triangular and square number > 3, which is 36: A001110(2).
a(4) is the least square and pentagonal number > 36, which is 9801: A036353(2).

Links

Crossrefs

Cf. A001110, A036353, A046180, A048903, A048906, A048924, A203627, A189216.

Programs

  • Mathematica
    a[n_] := Intersection[ Table[ PolygonalNumber[n, i], {i, 2, 10000}], Table[ PolygonalNumber[n + 1, i], {i, 2, 10000}]][[1]]; a[0] = 0; a[1] = 1; Array[a, 30, 0] (* Or *)
a[n_] := a[n] = 6a[n - 1] -15a[n - 2] +20a[n - 3] -15a[n - 4] +6a[n - 5] -a[n - 6]; a[0] = 0; a[1] = 1; a[2] = 3; a[3] = 36; a[4] = 9801; a[5] = 40755; a[6] = 121771; a[7] = 297045; a[8] = 631125; a[9] = 1212751; Array[a, 30, 0]

Formula

a(n) = 32n^5 - 112n^4 + 70n^3 + 93n^2 - 57n - 35 for n > 3; a(0) = 0, a(1) = 1, a(2) = 3, a(3) = 36.
G.f.: x*(1 - 3*x + 33*x^2 + 9610*x^3 - 17556*x^4 + 23575*x^5 - 17753*x^6 + 7122*x^7 - 1189*x^8)/(1 - x)^6. - Stefano Spezia, Jun 08 2021

A378245 Numbers that are both k-gonal and (k+1)-gonal for some k >= 3.

Original entry on oeis.org

1, 36, 1225, 9801, 40755, 41616, 121771, 297045, 631125, 1212751, 1413721, 2158695, 3617601, 5773825, 8851275, 13117251, 18886285, 26523981, 36450855, 48024900, 49146175, 65151801, 85076025, 94109401, 109597411, 139468635, 175520325, 218664901, 269900415, 330314391
Offset: 1

Views

Author

Kelvin Voskuijl, Nov 20 2024

Keywords

Examples

			a(2) = 36 is both the 8th triangular and the 6th square number.
a(3) = 1225 is both the 49th triangular and the 35th square number.
a(5) = 40755 is both the 165th pentagonal number and the 143th hexagonal number.

Crossrefs

Cf. A057145, A342300.
Cf. A001110, A036353, A046180, A048903, A048906, A048924 and A203627 (subsequences).
The subdiagonal of A189216 is also a subsequence.

Programs

  • PARI
    upto(limit) = my(terms=List(1)); for(k=3, oo, my(found=0); for(n=2, oo, my(a = (2*n - 1)^2, b = (4*n*(3*n - 5) + 6), c = (8*(n-1)^2 + 1), s = (a*k^2 - b*k + c), v = n * (n*k - k - 2*n + 4) / 2); if(issquare(s), my(t = sqrtint(s) + k - 3); if(t % (2*(k-1)) == 0, listput(terms, v); found += 1)); if(v >= limit, break)); if(found == 0, break)); Vec(vecsort(terms)); \\ Daniel Suteu, Dec 08 2024

Extensions

a(12)-a(30) from Pontus von Brömssen, Dec 07 2024
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.