A275340 -id:A275340 - cp's OEIS frontend

A090466 Regular figurative or polygonal numbers of order greater than 2.

6, 9, 10, 12, 15, 16, 18, 21, 22, 24, 25, 27, 28, 30, 33, 34, 35, 36, 39, 40, 42, 45, 46, 48, 49, 51, 52, 54, 55, 57, 58, 60, 63, 64, 65, 66, 69, 70, 72, 75, 76, 78, 81, 82, 84, 85, 87, 88, 90, 91, 92, 93, 94, 95, 96, 99, 100, 102, 105, 106, 108, 111, 112, 114, 115, 117, 118

Offset: 1

Robert G. Wilson v, Dec 01 2003

The sorted k-gonal numbers of order greater than 2. If one were to include either the rank 2 or the 2-gonal numbers, then every number would appear.
Number of terms less than or equal to 10^k for k = 1,2,3,...: 3, 57, 622, 6357, 63889, 639946, 6402325, 64032121, 640349979, 6403587409, 64036148166, 640362343980, ..., . - Robert G. Wilson v, May 29 2014
The n-th k-gonal number is 1 + k*n(n-1)/2 - (n-1)^2 = A057145(k,n).
For all squares (A001248) of primes p >= 5 at least one a(n) exists with p^2 = a(n) + 1. Thus the subset P_s(3) of rank 3 only is sufficient. Proof: For p >= 5, p^2 == 1 (mod {3,4,6,8,12,24}) and also P_s(3) + 1 = 3*s - 2 == 1 (mod 3). Thus the set {p^2} is a subset of {P_s(3) + 1}; Q.E.D. - Ralf Steiner, Jul 15 2018
For all primes p > 5, at least one polygonal number exists with P_s(k) + 1 = p when k = 3 or 4, dependent on p mod 6. - Ralf Steiner, Jul 16 2018
Numbers m such that r = (2*m/d - 2)/(d - 1) is an integer for some d, where 2 < d < m is a divisor of 2*m. If r is an integer, then m is the d-th (r+2)-gonal number. - Jianing Song, Mar 14 2021

Albert H. Beiler, Recreations In The Theory Of Numbers, The Queen Of Mathematics Entertains, Dover, NY, 1964, pp. 185-199.

Robert G. Wilson v, Table of n, a(n) for n = 1..10000 (first 1000 terms are from T. D. Noe)
Felix Ponomarenko and Vadim Ponomarenko, Polygonal Simplex Numbers, San Diego State Univ., 2025.
Eric Weisstein's World of Mathematics, Figurate Number
Index to sequences related to polygonal numbers

Cf. A057145, A001248, A177028 (A342772, A342805), A177201, A316676, A364693 (characteristic function).
Complement is A090467.
Sequence A090428 (excluding 1) is a subsequence of this sequence. - T. D. Noe, Jun 14 2012
Other subsequences: A324972 (squarefree terms), A324973, A342806, A364694.
Cf. also A275340.

isA090466 := proc(n)
    local nsearch,ksearch;
    for nsearch from 3 do
        if A057145(nsearch,3) > n then
            return false;
        end if;
        for ksearch from 3 do
            if A057145(nsearch,ksearch) = n then
                return true;
            elif A057145(nsearch,ksearch) > n then
                break;
            end if;
        end do:
    end do:
end proc:
for n from 1 to 1000 do
    if isA090466(n) then
        printf("%d,",n) ;
    end if;
end do: # R. J. Mathar, Jul 28 2016

Take[Union[Flatten[Table[1+k*n (n-1)/2-(n-1)^2,{n,3,100},{k,3,40}]]],67] (* corrected by Ant King, Sep 19 2011 *)
mx = 150; n = k = 3; lst = {}; While[n < Floor[mx/3]+2, a = PolygonalNumber[n, k]; If[a < mx+1, AppendTo[ lst, a], (n++; k = 2)]; k++]; lst = Union@ lst (* Robert G. Wilson v, May 29 2014 and updated Jul 23 2018; PolygonalNumber requires version 10.4 or higher *)

list(lim)=my(v=List()); lim\=1; for(n=3,sqrtint(8*lim+1)\2, for(k=3,2*(lim-2*n+n^2)\n\(n-1), listput(v, 1+k*n*(n-1)/2-(n-1)^2))); Set(v); \\ Charles R Greathouse IV, Jan 19 2017

is(n)=for(s=3,n\3+1,ispolygonal(n,s)&&return(s)); \\ M. F. Hasler, Jan 19 2017

isA090466(m) = my(v=divisors(2*m)); for(i=3, #v, my(d=v[i]); if(d==m, return(0)); if((2*m/d - 2)%(d - 1)==0, return(1))); 0 \\ Jianing Song, Mar 14 2021

Integer k is in this sequence iff A176774(k) < k. - Max Alekseyev, Apr 24 2018

Verified by Don Reble, Mar 12 2006

A279830 a(n) = the least integer that is centered polygonal in exactly n ways.

Original entry on oeis.org

4, 7, 37, 31, 91, 181, 211, 421, 631, 1891, 1261, 2521, 6931, 18481, 20791, 13861, 27721, 41581, 83161, 138601, 245701, 235621, 180181, 556921, 360361, 540541, 1670761, 1081081, 1413721, 2702701, 2162161, 6486481, 3063061, 8288281, 13430341, 6846841, 10270261, 6126121

Offset: 1

Daniel Sterman, Dec 20 2016

nonn

a(n) has exactly n representations as a centered r-gonal number P(r,m) = 1 + r*m*(m+1)/2, with m > 1, r > 0.
a(n) appears n+1 times in A101321, due to the second column containing every positive integer.
a(n)-1 is the first appearance of n+1 in A007862.

			a(4)=31, because 31 is a centered triangular number (A005448), a centered pentagonal number (A005891), a centered decagonal number (A062786), and a central polygonal number (A002061). No number less than 31 has 4 representations.

Lars Blomberg, Table of n, a(n) for n = 1..143

Cf. A007862 (see alternative definition: the number of ways to represent n+1 as a centered polygonal number).
Cf. A063778 (the equivalent for polygonal numbers).
Subset of A275340 (the list of nontrivial centered polygonal numbers).
Subset of A101321 (centered polygonal numbers read by antidiagonals).

f[n_] := Length@Select[Divisors[2 n - 2], IntegerQ@Sqrt[1 + 4 #] &] - 1;
Do[If[IntegerQ[A279830[f[i]]], , A279830[f[i]] = i], {i, 10000}];
A279830 /@ Range[13]
(* Davin Park, Dec 28 2016 *)

Corrected and extended by Davin Park, Dec 27 2016

A279831 Numbers that are centered k-gonal numbers for two or more values of k.

Original entry on oeis.org

1, 7, 13, 16, 19, 22, 25, 31, 37, 43, 46, 49, 55, 61, 64, 67, 73, 76, 79, 85, 91, 97, 103, 106, 109, 111, 115, 121, 127, 133, 136, 139, 141, 145, 148, 151, 154, 157, 163, 166, 169, 172, 175, 181, 187, 190, 191, 193, 196, 199, 205, 211, 217, 221, 223, 226, 229, 232, 235, 241, 247, 253, 256

Offset: 1

Daniel Sterman, Dec 20 2016

nonn

Numbers satisfying 1 + n*m*(m+1)/2 for two or more values of (n,m), where n>=0 m>1.

Numbers in this sequence appear in A101321 at least three times (because the second column contains every positive integer).

			19 is in the sequence because 19 is both a centered triangular number and a centered hexagonal number.

Daniel Sterman, Table of n, a(n) for a(n)<1000

Cf. A090428 (rough equivalent for polygonal numbers).
Cf. A101321 (table of all centered polygonal numbers).
Cf. A275340 (list of nontrivial centered polygonal numbers).

A279846 Numbers that are centered k-gonal numbers for three or more values of k.

Original entry on oeis.org

1, 31, 37, 43, 46, 61, 67, 73, 79, 85, 91, 106, 109, 121, 127, 133, 136, 145, 151, 157, 166, 169, 181, 199, 211, 217, 226, 232, 235, 241, 253, 265, 271, 274, 277, 289, 295, 301, 307, 313, 316, 325, 331, 337, 343, 361, 379, 391, 397, 406, 409, 421, 433, 451, 463, 469, 481, 496, 505, 511

Offset: 1

Daniel Sterman, Dec 20 2016

nonn

Numbers satisfying 1 + n*m*(m+1)/2 for three or more values of (n,m), where n >= 0 m > 1.

Numbers in this sequence appear in A101321 at least four times (because the second column contains every positive integer).

			109 is in the sequence because 109 is a centered triangular number, a centered 18-gonal number, and a centered 36-gonal number.

Daniel Sterman, Table of n, a(n) for a(n)<1000

Cf. A062712 (rough equivalent for polygonal numbers).
Cf. A101321 (table of all centered polygonal numbers).
Cf. A275340 (list of nontrivial centered polygonal numbers).

cp's OEIS Frontend

A090466 Regular figurative or polygonal numbers of order greater than 2.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

PARI

Formula

Extensions

A279830 a(n) = the least integer that is centered polygonal in exactly n ways.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A279831 Numbers that are centered k-gonal numbers for two or more values of k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A279846 Numbers that are centered k-gonal numbers for three or more values of k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs