A001107 -id:A001107 - cp's OEIS frontend

A139601 Square array of polygonal numbers read by ascending antidiagonals: T(n, k) = (n + 1)(k - 1)k/2 + k.

0, 0, 1, 0, 1, 3, 0, 1, 4, 6, 0, 1, 5, 9, 10, 0, 1, 6, 12, 16, 15, 0, 1, 7, 15, 22, 25, 21, 0, 1, 8, 18, 28, 35, 36, 28, 0, 1, 9, 21, 34, 45, 51, 49, 36, 0, 1, 10, 24, 40, 55, 66, 70, 64, 45, 0, 1, 11, 27, 46, 65, 81, 91, 92, 81, 55, 0, 1, 12, 30, 52, 75, 96, 112, 120, 117, 100, 66

Offset: 0

Omar E. Pol, Apr 27 2008

A general formula for polygonal numbers is P(n,k) = (n-2)(k-1)k/2 + k, where P(n,k) is the k-th n-gonal number. - Omar E. Pol, Dec 21 2008

			The square array of polygonal numbers begins:
========================================================
Triangulars .. A000217: 0, 1,  3,  6, 10,  15,  21,  28,
Squares ...... A000290: 0, 1,  4,  9, 16,  25,  36,  49,
Pentagonals .. A000326: 0, 1,  5, 12, 22,  35,  51,  70,
Hexagonals ... A000384: 0, 1,  6, 15, 28,  45,  66,  91,
Heptagonals .. A000566: 0, 1,  7, 18, 34,  55,  81, 112,
Octagonals ... A000567: 0, 1,  8, 21, 40,  65,  96, 133,
9-gonals ..... A001106: 0, 1,  9, 24, 46,  75, 111, 154,
10-gonals .... A001107: 0, 1, 10, 27, 52,  85, 126, 175,
11-gonals .... A051682: 0, 1, 11, 30, 58,  95, 141, 196,
12-gonals .... A051624: 0, 1, 12, 33, 64, 105, 156, 217,
And so on ..............................................
========================================================

G. C. Greubel, Table of n, a(n) for the first 50 rows, flattened
Peter Luschny, Figurate number — a very short introduction. With plots from Stefan Friedrich Birkner.
Omar E. Pol, Polygonal numbers, An alternative illustration of initial terms.

Sequences of m-gonal numbers: A000217 (m=3), A000290 (m=4), A000326 (m=5), A000384 (m=6), A000566 (m=7), A000567 (m=8), A001106 (m=9), A001107 (m=10), A051682 (m=11), A051624 (m=12), A051865 (m=13), A051866 (m=14), A051867 (m=15), A051868 (m=16), A051869 (m=17), A051870 (m=18), A051871 (m=19), A051872 (m=20), A051873 (m=21), A051874 (m=22), A051875 (m=23), A051876 (m=24), A255184 (m=25), A255185 (m=26), A255186 (m=27), A161935 (m=28), A255187 (m=29), A254474 (m=30).
Cf. A000007, A000012, A000027, A002411, A006000, A006003, A006522.
Cf. A008585, A016957, A017329, A086270, A117142, A139606, A139607.
Cf. A139608, A139609, A139610, A139611, A139612, A139613, A139614.
Cf. A139615, A139616, A057145, A086271, A139600, A139617, A139618.
Cf. A139619, A139620.

T:= func< n,k | k*((n+1)*(k-1) +2)/2 >;
A139601:= func< n,k | T(n-k, k) >;
[A139601(n,k): k in  [0..n], n in [0..12]]; // G. C. Greubel, Jul 12 2024

T[n_, k_] := (n + 1)*(k - 1)*k/2 + k; Table[ T[n - k, k], {n, 0, 11}, {k, 0, n}] // Flatten (* Robert G. Wilson v, Jul 12 2009 *)

def T(n,k): return k*((n+1)*(k-1)+2)/2
def A139601(n,k): return T(n-k, k)
flatten([[A139601(n,k) for k in range(n+1)] for n in range(13)]) # G. C. Greubel, Jul 12 2024

T(n,k) = A086270(n,k), k>0. - R. J. Mathar, Aug 06 2008
T(n,k) = (n+1)*(k-1)*k/2 +k, n>=0, k>=0. - Omar E. Pol, Jan 07 2009
From G. C. Greubel, Jul 12 2024: (Start)
t(n, k) = (k/2)*( (k-1)*(n-k+1) + 2), where t(n,k) is this array read by rising antidiagonals.
t(2*n, n) = A006003(n).
t(2*n+1, n) = A002411(n).
t(2*n-1, n) = A006000(n-1).
Sum_{k=0..n} t(n, k) = A006522(n+2).
Sum_{k=0..n} (-1)^k*t(n, k) = (-1)^n * A117142(n).
Sum_{k=0..n} t(n-k, k) = (2*n^4 + 34*n^2 + 48*n - 15 + 3*(-1)^n*(2*n^2 + 16*n + 5))/384. (End)

A007585 10-gonal (or decagonal) pyramidal numbers: a(n) = n(n + 1)(8*n - 5)/6.

Original entry on oeis.org

0, 1, 11, 38, 90, 175, 301, 476, 708, 1005, 1375, 1826, 2366, 3003, 3745, 4600, 5576, 6681, 7923, 9310, 10850, 12551, 14421, 16468, 18700, 21125, 23751, 26586, 29638, 32915, 36425, 40176, 44176, 48433, 52955, 57750

Offset: 0

N. J. A. Sloane, R. K. Guy

Binomial transform of [1, 10, 17, 8, 0, 0, 0, ...] = (1, 11, 38, 90, ...). - Gary W. Adamson, Mar 18 2009
This sequence is related to A000384 by a(n) = n*A000384(n) - Sum_{i=0..n-1} A000384(i) and this is the case d=4 in the identity n*(n*(d*n-d+2)/2) - Sum_{k=0..n-1} k*(d*k-d+2)/2 = n*(n+1)*(2*d*n - 2*d + 3)/6. - Bruno Berselli, Apr 21 2010
For n>0, (a(n)) is the principal diagonal of the convolution array A213750. - Clark Kimberling, Jun 20 2012
From Ant King, Oct 30 2012: (Start)
The partial sums of the figurate decagonal numbers A001107.
For n>1, the digital roots of this sequence A010888(A007585(n)) form the purely periodic 27-cycle {1,2,2,9,4,4,8,6,6,7,8,8,6,1,1,5,3,3,4,5,5,3,7,7,2,9,9}.
For n>1, the units’ digits of this sequence A010879(A007585(n)) form the purely periodic 20-cycle {1,1,8,0,5,1,6,8,5,5,6,6,3,5,0,6,1,3,0,0}.
(End)

A. H. Beiler, Recreations in the Theory of Numbers, Dover, NY, 1964, p. 194.
E. Deza and M. M. Deza, Figurate numbers, World Scientific Publishing (2012), page 93.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Harvey P. Dale, Table of n, a(n) for n = 0..1000
B. Berselli, A description of the recursive method in Comments lines: website Matem@ticamente (in Italian).
Index to sequences related to pyramidal numbers
Index entries for linear recurrences with constant coefficients, signature (4,-6,4,-1)

Cf. A000384.
Cf. A093565 ((8, 1) Pascal, column m=3). Partial sums of A001107.
Cf. similar sequences listed in A237616.

List([0..40], n-> n*(n+1)*(8*n-5)/6); # G. C. Greubel, Aug 30 2019

[n*(n+1)*(8*n-5)/6: n in [0..40]]; // G. C. Greubel, Aug 30 2019

seq(n*(n+1)*(8*n-5)/6, n=0..40); # G. C. Greubel, Aug 30 2019

Table[n(n+1)(8n-5)/6, {n,0,40}] (* Vladimir Joseph Stephan Orlovsky, Apr 18 2011 *)
LinearRecurrence[{4,-6,4,-1},{0,1,11,38},40] (* Harvey P. Dale, Dec 20 2011 *)

a(n)=(8*n^3+3*n^2-5*n)/6 \\ Charles R Greathouse IV, Sep 24 2015

[n*(n+1)*(8*n-5)/6 for n in (0..40)] # G. C. Greubel, Aug 30 2019

a(n) = (8*n-5)*binomial(n+1, 2)/3.
G.f.: x*(1+7*x)/(1-x)^4.
a(n) = (8*n^3 + 3*n^2 - 5*n)/6. - Vincenzo Librandi, Aug 01 2010
a(0)=0, a(1)=1, a(2)=11, a(3)=38, a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4). - Harvey P. Dale, Dec 20 2011
From Ant King, Oct 30 2012: (Start)
a(n) = a(n-1) + n*(4*n-3).
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) + 8.
a(n) = (n+1)*(2*A001107(n) + n)/6.
a(n) = A000292(n) + 7*A000292(n-1).
a(n) = A007584(n) + A000292(n-1).
a(n) = A000217(n) + 8*A000292(n-1).
a(n) = binomial(n+2,3) + 7*binomial(n+1,3).
Sum_{n>=1} 1/a(n) = 6*(4*pi*(sqrt(2)-1) + 4*(8-sqrt(2))*log(2) + 8*sqrt(2)*log(2-sqrt(2))-5)/65 =  1.145932345...
(End)
a(n) = Sum_{i=0..n-1} (n-i)*(8*i+1), with a(0)=0. - Bruno Berselli, Feb 10 2014
E.g.f.: x*(6 + 27*x + 8*x^2)*exp(x)/6. - Ilya Gutkovskiy, May 12 2017

A033988 Write 0,1,2,... in a clockwise spiral on a square lattice, writing each digit at a separate lattice point, starting with 0 at the origin and 1 at x=0, y=-1; sequence gives the numbers on the positive y-axis.

Original entry on oeis.org

0, 5, 1, 4, 3, 7, 8, 0, 4, 7, 7, 1, 2, 6, 2, 1, 8, 7, 4, 2, 6, 1, 8, 9, 2, 7, 6, 0, 6, 5, 1, 2, 0, 4, 1, 5, 8, 5, 1, 8, 8, 8, 2, 1, 2, 3, 2, 4, 9, 0, 2, 8, 9, 9, 3, 3, 2, 0, 3, 7, 9, 3, 4, 2, 8, 8, 4, 7, 1, 5, 5, 3, 7, 4, 5, 9, 7, 5, 6, 5, 9, 8, 7, 1, 5, 3, 7, 8, 4, 0, 8, 5, 6, 9, 9, 3, 1, 0, 9, 8, 1, 1, 6, 9, 9

Offset: 0

N. J. A. Sloane

In other words, write 0 1 2 3 4 5 6 7 8 9 1 0 1 1 1 2 1 3 1 4 1 5 1 6 ... in a clockwise spiral, starting with the 0 and taking the first step south; the sequence is then picked out from the resulting spiral by starting at the origin and moving north.

			  1---3---1---4---1
  |               |
  2   4---5---6   5
  |   |       |   |
  1   3   0   7   1
  |   |   |   |   |
  1   2---1   8   6
  |           |   |
  1---0---1---9   1
.
We begin with the 0 and wrap the numbers 1 2 3 4 ... around it.
Then the sequence is obtained by reading vertically upwards, starting from the initial 0.

Andrew Woods, Table of n, a(n) for n = 0..1000

Sequences based on the same spiral: A033953, A033989, A033990. Spiral without zero: A033952.
Other sequences from spirals: A001107, A002939, A007742, A033951, A033954, A033991, A002943, A033996.
Cf. A033307.

nmax = 105; A033307 = Flatten[IntegerDigits /@ Range[0, nmax^2 + 10 nmax]]; a[n_] := If[n==0, 0, A033307[[4n^2 + n + 1]]]; Table[a[n], {n, 0, nmax}] (* Jean-François Alcover, Apr 24 2017, after Andrew Woods *)

a(n) = A033307(4*n^2 + n - 1) for n > 0. - Andrew Woods, May 18 2012

More terms from Andrew Gacek (andrew(AT)dgi.net)

Edited by Jon E. Schoenfield, Aug 12 2018

A033989 Write 0,1,2,... in a clockwise spiral on a square lattice, writing each digit at a separate lattice point, starting with 0 at the origin and 1 at x=0, y=-1; sequence gives the numbers on the negative x-axis.

Original entry on oeis.org

0, 3, 1, 1, 3, 2, 7, 9, 1, 1, 6, 9, 4, 7, 9, 1, 2, 1, 2, 1, 6, 7, 4, 3, 6, 1, 2, 9, 5, 1, 1, 0, 9, 3, 1, 3, 6, 6, 1, 8, 6, 9, 2, 5, 0, 2, 2, 4, 6, 6, 2, 5, 6, 0, 3, 8, 9, 5, 3, 3, 6, 9, 4, 0, 5, 4, 4, 9, 8, 0, 5, 0, 4, 5, 5, 3, 3, 1, 6, 8, 5, 8, 6, 5, 1, 4, 7, 4, 9, 1, 8, 5, 1, 9, 9, 8, 6, 6, 9, 1, 1, 6, 4, 8, 1

Offset: 0

N. J. A. Sloane

			  2---3---2---4---2---5---2
  |                       |
  2   1---3---1---4---1   6
  |   |               |   |
  2   2   4---5---6   5   2
  |   |   |       |   |   |
  1   1   3   0   7   1   7
  |   |   |   |   |   |   |
  2   1   2---1   8   6   2
  |   |           |   |   |
  0   1---0---1---9   1   8
  |                   |   |
  2---9---1---8---1---7   2
We begin with the 0 and wrap the numbers 1 2 3 4 ... around it. Then the sequence is obtained by reading leftwards, starting from the initial 0. - _Andrew Woods_, May 20 2012

Reinhard Zumkeller, Table of n, a(n) for n = 0..1000

Sequences based on the same spiral: A033953, A033988, A033990. Spiral without zero: A033952.

Other sequences from spirals: A001107, A002939, A007742, A033951, A033954, A033991, A002943, A033996, A033988.

a033989 0 = 0
a033989 n = a033307 $ a185950 n  -- Reinhard Zumkeller, Aug 14 2013

nmax = 1000; A033307 = Flatten[IntegerDigits /@ Range[0, nmax^2+10*nmax]]; a[n_] := If[n==0, 0, A033307[[4n^2-n+1]]]; Table[a[n], {n, 0, nmax}] (* Jean-François Alcover, Apr 23 2017, after Andrew Woods *)

a(n) = A033307(4*n^2-n-1) for n > 0. - Andrew Woods, May 20 2012

More terms from Andrew J. Gacek (andrew(AT)dgi.net)

Edited by Charles R Greathouse IV, Nov 01 2009

A093565 (8,1) Pascal triangle.

Original entry on oeis.org

1, 8, 1, 8, 9, 1, 8, 17, 10, 1, 8, 25, 27, 11, 1, 8, 33, 52, 38, 12, 1, 8, 41, 85, 90, 50, 13, 1, 8, 49, 126, 175, 140, 63, 14, 1, 8, 57, 175, 301, 315, 203, 77, 15, 1, 8, 65, 232, 476, 616, 518, 280, 92, 16, 1, 8, 73, 297, 708, 1092, 1134, 798, 372, 108, 17, 1, 8, 81, 370, 1005

Offset: 0

Wolfdieter Lang, Apr 22 2004

The array F(8;n,m) gives in the columns m>=1 the figurate numbers based on A017077, including the decagonal numbers A001107,(see the W. Lang link).
This is the eighth member, d=8, in the family of triangles of figurate numbers, called (d,1) Pascal triangles: A007318 (Pascal), A029653, A093560-4, for d=1..7.
This is an example of a Riordan triangle (see A093560 for a comment and A053121 for a comment and the 1991 Shapiro et al. reference on the Riordan group). Therefore the o.g.f. for the row polynomials p(n,x):=Sum_{m=0..n} a(n,m)*x^m is G(z,x)=(1+7*z)/(1-(1+x)*z).
The SW-NE diagonals give A022098(n-1) = Sum_{k=0..ceiling((n-1)/2)} a(n-1-k,k), n >= 1, with n=0 value 7. Observation by Paul Barry, Apr 29 2004. Proof via recursion relations and comparison of inputs.

			Triangle begins
  [1];
  [8,  1];
  [8,  9,  1];
  [8, 17, 10,  1];
  ...

Kurt Hawlitschek, Johann Faulhaber 1580-1635, Veroeffentlichung der Stadtbibliothek Ulm, Band 18, Ulm, Germany, 1995, Ch. 2.1.4. Figurierte Zahlen.
Ivo Schneider: Johannes Faulhaber 1580-1635, Birkhäuser, Basel, Boston, Berlin, 1993, ch.5, pp. 109-122.

Reinhard Zumkeller, Rows n = 0..125 of triangle, flattened
W. Lang, First 10 rows and array of figurate numbers .

Row sums: A005010(n-1), n>=1, 1 for n=0, alternating row sums are 1 for n=0, 7 for n=2 and 0 else.
The column sequences give for m=1..9: A017077, A001107 (decagonal), A007585, A051797, A051878, A050404, A052226, A056001, A056122.
Cf. A093644 (d=9).

a093565 n k = a093565_tabl !! n !! k
a093565_row n = a093565_tabl !! n
a093565_tabl = [1] : iterate
               (\row -> zipWith (+) ([0] ++ row) (row ++ [0])) [8, 1]
-- Reinhard Zumkeller, Aug 31 2014

a(n, m)=F(8;n-m, m) for 0<= m <= n, otherwise 0, with F(8;0, 0)=1, F(8;n, 0)=8 if n>=1 and F(8;n, m):=(8*n+m)*binomial(n+m-1, m-1)/m if m>=1.
Recursion: a(n, m)=0 if m>n, a(0, 0)= 1; a(n, 0)=8 if n>=1; a(n, m)= a(n-1, m) + a(n-1, m-1).
G.f. column m (without leading zeros): (1+7*x)/(1-x)^(m+1), m>=0.
T(n, k) = C(n, k) + 7*C(n-1, k). - Philippe Deléham, Aug 28 2005
exp(x) * e.g.f. for row n = e.g.f. for diagonal n. For example, for n = 3 we have exp(x)*(8 + 17*x + 10*x^2/2! + x^3/3!) = 8 + 25*x + 52*x^2/2! + 90*x^3/3! + 140*x^4/4! + .... The same property holds more generally for Riordan arrays of the form ( f(x), x/(1 - x) ). - Peter Bala, Dec 22 2014

A115258 Isolated primes in Ulam's lattice (1, 2, ... in spiral).

Original entry on oeis.org

83, 101, 127, 137, 163, 199, 233, 311, 373, 443, 463, 491, 541, 587, 613, 631, 641, 659, 673, 683, 691, 733, 757, 797, 859, 881, 911, 919, 953, 971, 991, 1013, 1051, 1061, 1103, 1109, 1117, 1193, 1201, 1213, 1249, 1307, 1319, 1409, 1433, 1459, 1483, 1487

Offset: 1

Giorgio Balzarotti and Paolo P. Lava, Feb 17 2006

nonn

Isolated prime numbers have no adjacent primes in a lattice generated by writing consecutive integers starting from 1 in a spiral distribution. If n0 is the number of isolated primes and p the number of primes less than N, the ratio n0/p approaches 1 as N increases. If n1, n2, n3, n4 denote the number of primes with respectively 1, 2, 3, 4 adjacent primes in the lattice, the ratios n1/n0, n2/n1, n3/n2, n4/n3 approach 0 as N increases. The limits stand for any 2D lattice of integers generated by a priori criteria (i.e., not knowing distributions of primes) as Ulam's lattice.

			83 is an isolated prime as the adjacent numbers in lattice 50, 51, 81, 82, 84, 123, 124, 125 are not primes.
From _Michael De Vlieger_, Dec 22 2015: (Start)
Spiral including n <= 17^2 showing only primes, with the isolated primes in parentheses (redrawn by _Jon E. Schoenfield_, Aug 06 2017):
  257 .  .  .  .  . 251 .  .  .  .  .  .  .  .  . 241
   . 197 .  .  . 193 . 191 .  .  .  .  .  .  .  .  .
   .  .  .  .  .  .  .  . 139 .(137).  .  .  .  . 239
   .(199).(101).  .  . 97  .  .  .  .  .  .  . 181 .
   .  .  .  .  .  .  .  . 61  . 59  .  .  . 131 .  .
   .  .  . 103 . 37  .  .  .  .  . 31  . 89  . 179 .
  263 . 149 . 67  . 17  .  .  . 13  .  .  .  .  .  .
   .  .  .  .  .  .  .  5  .  3  . 29  .  .  .  .  .
   .  . 151 .  .  . 19  .  .  2 11  . 53  .(127).(233)
   .  .  . 107 . 41  .  7  .  .  .  .  .  .  .  .  .
   .  .  .  . 71  .  .  . 23  .  .  .  .  .  .  .  .
   .  .  . 109 . 43  .  .  . 47  .  .  .(83) . 173 .
  269 .  .  . 73  .  .  .  .  . 79  .  .  .  .  . 229
   .  .  .  .  . 113 .  .  .  .  .  .  .  .  .  .  .
  271 . 157 .  .  .  .  .(163).  .  . 167 .  .  . 227
   . 211 .  .  .  .  .  .  .  .  .  .  . 223 .  .  .
   .  .  .  . 277 .  .  . 281 . 283 .  .  .  .  .  .
(End)

G. Balzarotti and P. P. Lava, Le sequenze di numeri interi, Hoepli, 2008, p. 22.

Michael De Vlieger, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Prime Spiral.

Cf. A001107, A002939, A007742, A033951-A033954, A033989, A033990, A033991, A002943, A033996, A033988, A014848.

Cf. A113688 (isolated semiprimes in the semiprime spiral), A156859.

# A is Ulam's lattice
if (isprime(A[x,y])and(not(isprime(A[x+1,y]) or isprime(A[x-1,y])or isprime(A[x,y+1])or isprime(A[x,y-1])or isprime(A[x-1,y-1])or isprime(A[x+1,y+1])or isprime(A[x+1,y-1])or isprime(A[x-1,y+1])))) then print (A[x,y]) ; fi;

spiral[n_] := Block[{o = 2 n - 1, t, w}, t = Table[0, {o}, {o}]; t = ReplacePart[t, {n, n} -> 1]; Do[w = Partition[Range[(2 (# - 1) - 1)^2 + 1, (2 # - 1)^2], 2 (# - 1)] &@ k; Do[t = ReplacePart[t, {(n + k) - (j + 1), n + (k - 1)} -> #[[1, j]]]; t = ReplacePart[t, {n - (k - 1), (n + k) - (j + 1)} -> #[[2, j]]]; t = ReplacePart[t, {(n - k) + (j + 1), n - (k - 1)} -> #[[3, j]]]; t = ReplacePart[t, {n + (k - 1), (n - k) + (j + 1)} -> #[[4, j]]], {j, 2 (k - 1)}] &@ w, {k, 2, n}]; t]; f[w_] := Block[{d = Dimensions@ w, t, g}, t = Reap[Do[Sow@ Take[#[[k]], {2, First@ d - 1}], {k, 2, Last@ d - 1}]][[-1, 1]] &@ w; g[n_] := If[n != 0, Total@ Join[Take[w[[Last@ # - 1]], {First@ # - 1, First@ # + 1}], {First@ #, Last@ #} &@ Take[w[[Last@ #]], {First@ # - 1, First@ # + 1}], Take[w[[Last@ # + 1]], {First@ # - 1, First@# + 1}]] &@(Reverse@ First@ Position[t, n] + {1, 1}) == 0, False]; Select[Union@ Flatten@ t, g@ # &]]; f[spiral@ 21 /. n_ /; CompositeQ@ n -> 0] (* Michael De Vlieger, Dec 22 2015, Version 10 *)

A118729 Rectangular array where row r contains the 8 numbers 4r^2 - 3r, 4r^2 - 2r, ..., 4r^2 + 4r.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 18, 20, 22, 24, 27, 30, 33, 36, 39, 42, 45, 48, 52, 56, 60, 64, 68, 72, 76, 80, 85, 90, 95, 100, 105, 110, 115, 120, 126, 132, 138, 144, 150, 156, 162, 168

Offset: 0

Stuart M. Ellerstein (ellerstein(AT)aol.com), May 21 2006

The numbers in row r span the interval ]8*A000217(r-1), 8*A000217(r)].
The first difference between the entries in row r is r.
Partial sums of floor(n/8). - Philippe Deléham, Mar 26 2013
Apart from the initial zeros, the same as A008726. - Philippe Deléham, Mar 28 2013
a(n+7) is the number of key presses required to type a word of n letters, all different, on a keypad with 8 keys where 1 press of a key is some letter, 2 presses is some other letter, etc., and under an optimal mapping of letters to keys and presses (answering LeetCode problem 3014). - Christopher J. Thomas, Feb 16 2024

			The array starts, with row r=0, as
  r=0:   0  0  0  0  0  0  0  0;
  r=1:   1  2  3  4  5  6  7  8;
  r=2:  10 12 14 16 18 20 22 24;
  r=3:  27 30 33 36 39 42 45 48;

G. C. Greubel, Table of n, a(n) for n = 0..1000
LeetCode, 3014. Minimum Number of Pushes to Type Word I.
Index entries for linear recurrences with constant coefficients, signature (2,-1,0,0,0,0,0,1,-2,1).

Cf. similar sequences: A000217, A002620, A130518, A130519, A130520, A174709, A174738, A218470, A131242.

Flatten[Table[4r^2+r(Range[-3,4]),{r,0,6}]] (* or *) LinearRecurrence[ {2,-1,0,0,0,0,0,1,-2,1},{0,0,0,0,0,0,0,0,1,2},60] (* Harvey P. Dale, Nov 26 2015 *)

From Philippe Deléham, Mar 26 2013: (Start)
a(8k)   = A001107(k).
a(8k+1) = A002939(k).
a(8k+2) = A033991(k).
a(8k+3) = A016742(k).
a(8k+4) = A007742(k).
a(8k+5) = A002943(k).
a(8k+6) = A033954(k).
a(8k+7) = A033996(k). (End)
G.f.: x^8/((1-x)^2*(1-x^8)). - Philippe Deléham, Mar 28 2013
a(n) = floor(n/8)*(n-3-4*floor(n/8)). - Ridouane Oudra, Jun 04 2019
a(n+7) = (1/2)*(n+(n mod 8))*(floor(n/8)+1). - Christopher J. Thomas, Feb 13 2024

Redefined as a rectangular tabf array and description simplified by R. J. Mathar, Oct 20 2010

A051872 20-gonal (or icosagonal) numbers: a(n) = n(9n-8).

Original entry on oeis.org

0, 1, 20, 57, 112, 185, 276, 385, 512, 657, 820, 1001, 1200, 1417, 1652, 1905, 2176, 2465, 2772, 3097, 3440, 3801, 4180, 4577, 4992, 5425, 5876, 6345, 6832, 7337, 7860, 8401, 8960, 9537, 10132, 10745, 11376, 12025, 12692, 13377, 14080

Offset: 0

N. J. A. Sloane, Dec 15 1999

This sequence does not contain any squares other than 0 and 1. See A188896. - T. D. Noe, Apr 13 2011
Sequence found by reading the line from 0, in the direction 0, 20,... and the parallel line from 1, in the direction 1, 57,..., in the square spiral whose vertices are the generalized 20-gonal numbers. - Omar E. Pol, Jul 18 2012
This is also a star decagonal number: a(n) = A001107(n) + 10*A000217(n-1). - Luciano Ancora, Mar 30 2015

Albert H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, p. 189.
E. Deza and M. M. Deza, Figurate numbers, World Scientific Publishing (2012), page 6.

Ivan Panchenko, Table of n, a(n) for n = 0..1000
Index to sequences related to polygonal numbers
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

A051872 := proc(n) n*(9*n-8) ;end proc: seq(A051872(n),n=0..30) ; # R. J. Mathar, Feb 05 2011

Table[9n^2 - 8n, {n, 0, 59}] (* Alonso del Arte, Dec 20 2014 *)
PolygonalNumber[20,Range[0,50]] (* Requires Mathematica version 10 or later *)  (* Harvey P. Dale, May 14 2017 *)

n*(9*n-8) \\ Charles R Greathouse IV, Jan 24 2014

a(n) = 18*n + a(n-1) - 17, with n > 0, a(0) = 0. - Vincenzo Librandi, Aug 06 2010
G.f.: x*(1+17*x)/(1-x)^3. - Bruno Berselli, Feb 04 2011
a(18*a(n) + 154*n + 1) = a(18*a(n) + 154*n) + a(18*n + 1). - Vladimir Shevelev, Jan 24 2014
Product_{n>=2} (1 - 1/a(n)) = 9/10. - Amiram Eldar, Jan 22 2021
For n>0, a(n) = A002378(3*n-2) + n - 2. - Charlie Marion, Jul 18 2022
E.g.f.: exp(x)*(x + 9*x^2). - Nikolaos Pantelidis, Feb 05 2023

A220212 Convolution of natural numbers (A000027) with tetradecagonal numbers (A051866).

Original entry on oeis.org

0, 1, 16, 70, 200, 455, 896, 1596, 2640, 4125, 6160, 8866, 12376, 16835, 22400, 29240, 37536, 47481, 59280, 73150, 89320, 108031, 129536, 154100, 182000, 213525, 248976, 288666, 332920, 382075, 436480, 496496, 562496, 634865, 714000, 800310, 894216, 996151

Offset: 0

Bruno Berselli, Dec 08 2012

Partial sums of A172073.

Apart from 0, all terms are in A135021: a(n) = A135021(A034856(n+1)) with n>0.

Bruno Berselli, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).
Index to sequences related to pyramidal numbers.

Cf. A135021, A172073.
Cf. convolution of the natural numbers (A000027) with the k-gonal numbers (* means "except 0"):
k= 2 (A000027 ): A000292;
k= 3 (A000217 ): A000332 (after the third term);
k= 4 (A000290 ): A002415 (after the first term);
k= 5 (A000326 ): A001296;
k= 6 (A000384*): A002417;
k= 7 (A000566 ): A002418;
k= 8 (A000567*): A002419;
k= 9 (A001106*): A051740;
k=10 (A001107*): A051797;
k=11 (A051682*): A051798;
k=12 (A051624*): A051799;
k=13 (A051865*): A055268.
Cf. similar sequences with formula n*(n+1)*(n+2)*(k*n-k+2)/12 listed in A264850.

A051866:=func; [&+[(n-k+1)*A051866(k): k in [0..n]]: n in [0..37]];

I:=[0,1,16,70,200]; [n le 5 select I[n] else 5*Self(n-1)-10*Self(n-2)+10*Self(n-3)-5*Self(n-4)+Self(n-5): n in [1..50]]; // Vincenzo Librandi, Aug 18 2013

A051866[k_] := k (6 k - 5); Table[Sum[(n - k + 1) A051866[k], {k, 0, n}], {n, 0, 37}]
CoefficientList[Series[x (1 + 11 x) / (1 - x)^5, {x, 0, 40}], x] (* Vincenzo Librandi, Aug 18 2013 *)

G.f.: x*(1+11*x)/(1-x)^5.
a(n) = n*(n+1)*(n+2)*(3*n-2)/6.
From Amiram Eldar, Feb 15 2022: (Start)
Sum_{n>=1} 1/a(n) = 3*(3*sqrt(3)*Pi + 27*log(3) - 17)/80.
Sum_{n>=1} (-1)^(n+1)/a(n) = 3*(6*sqrt(3)*Pi - 64*log(2) + 37)/80. (End)

A033990 Write 0,1,2,... in a clockwise spiral on a square lattice, writing each digit at a separate lattice point, starting with 0 at the origin and 1 at x=0, y=-1; sequence gives the numbers on the negative y-axis.

Original entry on oeis.org

0, 1, 1, 8, 3, 7, 6, 2, 1, 5, 1, 1, 6, 2, 2, 1, 3, 4, 0, 4, 5, 3, 6, 7, 0, 8, 9, 1, 4, 6, 1, 2, 7, 1, 1, 4, 4, 8, 1, 7, 4, 7, 2, 0, 8, 8, 2, 4, 4, 1, 2, 8, 4, 6, 3, 2, 7, 3, 3, 7, 3, 2, 4, 1, 2, 3, 4, 7, 5, 6, 5, 2, 0, 1, 5, 8, 9, 8, 6, 4, 1, 7, 6, 1, 7, 8, 7, 7, 5, 1, 8, 4, 7, 6, 9, 2, 2, 3, 9, 0, 1, 0, 1, 6, 8

Offset: 0

N. J. A. Sloane

Consider array of digits 0_(1)23456789(1)0111213141516171(8)1920212223...; in this array add to n-th pointer 8*n+1 to get next pointer. E.g., n=1 so n+(8*1+1)=10 -> n=10 so n+(8*2+1)=27 -> n=27 so ... etc. - comment from Patrick De Geest.

			The spiral begins
                 2---3---2---4---2---5---2
                 |                       |
                 2   1---3---1---4---1   6
                 |   |               |   |
                 2   2   4---5---6   5   2
                 |   |   |       |   |   |
                 1   1   3   0   7   1   7
                 |   |   |   |   |   |   |
                 2   1   2---1   8   6   2
                 |   |           |   |   |
                 0   1---0---1---9   1   8
                 |                   |   |
                 2---9---1---8---1---7   2
                                         |
                             3---0---3---9
.
We begin with the 0 and wrap the numbers 1 2 3 4 ... around it. Then the sequence is obtained by reading downwards, starting from the initial 0. - _Andrew Woods_, May 20 2012

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

Sequences based on the same spiral: A033953, A033988, A033989. Spiral without zero: A033952.

Other sequences from spirals: A001107, A002939, A007742, A033951, A033954, A033991, A002943, A033996, A033988.

nmax = 105; A033307 = Flatten[IntegerDigits /@ Range[0, nmax^2 + 10 nmax]]; a[n_] := If[n==0, 0, A033307[[4n^2 - 3n + 1]]]; Table[a[n], {n, 0, nmax}] (* Jean-François Alcover, Apr 24 2017, after Andrew Woods *)

a(n) = A033307(4*n^2-3*n-1) for n > 0. - Andrew Woods, May 20 2012

More terms from Patrick De Geest, Oct 15 1999

Edited by Charles R Greathouse IV, Nov 01 2009

cp's OEIS Frontend

A139601 Square array of polygonal numbers read by ascending antidiagonals: T(n, k) = (n + 1)*(k - 1)*k/2 + k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

SageMath

Formula

A007585 10-gonal (or decagonal) pyramidal numbers: a(n) = n*(n + 1)*(8*n - 5)/6.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

A033988 Write 0,1,2,... in a clockwise spiral on a square lattice, writing each digit at a separate lattice point, starting with 0 at the origin and 1 at x=0, y=-1; sequence gives the numbers on the positive y-axis.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A033989 Write 0,1,2,... in a clockwise spiral on a square lattice, writing each digit at a separate lattice point, starting with 0 at the origin and 1 at x=0, y=-1; sequence gives the numbers on the negative x-axis.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Haskell

Mathematica

Formula

Extensions

A093565 (8,1) Pascal triangle.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Formula

A115258 Isolated primes in Ulam's lattice (1, 2, ... in spiral).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

A118729 Rectangular array where row r contains the 8 numbers 4*r^2 - 3*r, 4*r^2 - 2*r, ..., 4*r^2 + 4*r.

Views

A139601 Square array of polygonal numbers read by ascending antidiagonals: T(n, k) = (n + 1)(k - 1)k/2 + k.

A007585 10-gonal (or decagonal) pyramidal numbers: a(n) = n(n + 1)(8*n - 5)/6.

A118729 Rectangular array where row r contains the 8 numbers 4r^2 - 3r, 4r^2 - 2r, ..., 4r^2 + 4r.

A051872 20-gonal (or icosagonal) numbers: a(n) = n(9n-8).