A009056 -id:A009056 - cp's OEIS frontend

A009005 All natural numbers except 1, 2 and 4.

3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77

Offset: 1

David W. Wilson

Short legs of Pythagorean triangles.
Also the natural numbers n such that there is an open knight's tour of the 4 X n chessboard. - Sharon Sela (sharonsela(AT)hotmail.com), Jan 02 2002
Also perimeters of integral triangles; equivalently, numbers n = a + b + c, where a + b > c, a + c > b, b + c > a, and a, b, c are integers (necessarily a, b, c, and n are positive). - Rick L. Shepherd, Aug 04 2013
Along with 0, possible scores in rugby union, where points can be scored with a penalty goal or drop goal (3 points), try (5 points) and converted try (7 points). - Charles R Greathouse IV, Sep 10 2016
Also the positive integers n such that floor(t(n+2)/(t(n+2) - sigma(n+2))) = 1, where t(n) = n*(n+1)/2 = A000217(n) and sigma(n) = A000203(n) (see A242963). - Lorenzo Sauras Altuzarra, Jan 29 2020

IBM Ponder This, December 2001
Index entries for linear recurrences with constant coefficients, signature (2,-1).

Cf. A000203 (sigma function), A000217 (triangular numbers), A242963.

Join[{3}, Range[5, 100]] (* Paolo Xausa, Sep 13 2024 *)

a(n)=n+4-(n==1) \\ Charles R Greathouse IV, Sep 02 2011

O.g.f.: x(3-x-x^2)/(1-x)^2. a(n)=A009056(n), n>1. - R. J. Mathar, May 26 2008

A062253 2nd level triangle related to Eulerian numbers and binomial transforms (triangle of Eulerian numbers is first level and triangle with Z(0,0)=1 and Z(n,k)=0 otherwise is 0th level).

Original entry on oeis.org

1, 3, 0, 7, 4, 0, 15, 30, 5, 0, 31, 146, 91, 6, 0, 63, 588, 868, 238, 7, 0, 127, 2136, 6126, 4096, 575, 8, 0, 255, 7290, 36375, 47400, 16929, 1326, 9, 0, 511, 23902, 193533, 434494, 306793, 64362, 2971, 10, 0, 1023, 76296, 956054, 3421902, 4169418, 1765940, 231462, 6534, 11, 0

Offset: 0

Henry Bottomley, Jun 14 2001

Binomial transform of n^2*k^n is ((kn)^2 + kn)*(k + 1)^(n - 2); of n^3*k^n is ((kn)^3 + 3(kn)^2 + (1 - k)(kn))*(k + 1)^(n - 3); of n^4*k^n is ((kn)^4 + 6(kn)^3 + (7 - 4k)(kn)^2 + (1 - 4k + k^2)(kn))*(k + 1)^(n - 4); of n^5*k^n is ((kn)^5 + 10(kn)^4 + (25 - 10k)(kn)^3 + (15 - 30k + 5k^2)(kn)^2 + (1 - 11k + 11k^2 - k^3)(kn))*(k + 1)^(n - 5); of n^6*k^n is ((kn)^6 + 15(kn)^5 + (65 - 20k)(kn)^4 + (90 - 120k + 15k^2)(kn)^3 + (31 - 146k + 91k^2 - 6k^3)(kn)^2 + (1 - 26k + 66k^2 - 26k^3 + k^4)(kn))*(k + 1)^(n - 6). This sequence gives the (unsigned) polynomial coefficients of (kn)^2.

			Rows start:
 (1),
 (3,0),
 (7,4,0),
 (15,30,5,0),
 ...

First column is A000225. Diagonals include A000007, A009056. Row sums are A000254. Taking all the levels together to create a pyramid, one face would be A010054 as a triangle with a parallel face which is Pascal's triangle (A007318) with two columns removed, another face would be a triangle of Stirling numbers of the second kind (A008277) and a third face would be A000007 as a triangle, with a triangle of Eulerian numbers (A008292), A062253, A062254 and A062255 as faces parallel to it. The row sums of this last group would provide a triangle of unsigned Stirling numbers of the first kind (A008275).

E(n, k) = if ((n<0) || (k<0), 0, if ((n==0) && (k==0), 1, (k+1)*E(n-1, k)+(n-k)*E(n-1, k-1)));
A2(n, k) = if ((n<0) || (k<0), 0, (k+2)*A2(n-1, k)+(n-k)*A2(n-1, k-1)+E(n, k));
row2(n) = vector(n+1, k, A2(n,k-1)); \\ Michel Marcus, Jan 27 2025

A(n, k) = (k+2)*A(n-1, k)+(n-k)*A(n-1, k-1)+E(n, k) where E(n, k)=(k+1)*E(n-1, k)+(n-k)*E(n-1, k-1) and E(0, 0)=1 is a triangle of Eulerian numbers, essentially A008292.

More terms from Michel Marcus, Jan 27 2025

A162995 A scaled version of triangle A162990.

Original entry on oeis.org

1, 3, 1, 12, 4, 1, 60, 20, 5, 1, 360, 120, 30, 6, 1, 2520, 840, 210, 42, 7, 1, 20160, 6720, 1680, 336, 56, 8, 1, 181440, 60480, 15120, 3024, 504, 72, 9, 1, 1814400, 604800, 151200, 30240, 5040, 720, 90, 10, 1

Offset: 1

Johannes W. Meijer, Jul 27 2009

We get this scaled version of triangle A162990 by dividing the coefficients in the left hand columns by their 'top-values' and then taking the square root.
T(n,k) = A173333(n+1,k+1), 1 <= k <= n. - Reinhard Zumkeller, Feb 19 2010
T(n,k) = A094587(n+1,k+1), 1 <= k <= n. - Reinhard Zumkeller, Jul 05 2012

			The first few rows of the triangle are:
[1]
[3, 1]
[12, 4, 1]
[60, 20, 5, 1]

Reinhard Zumkeller, Rows n = 1..150 of triangle, flattened

Cf. A094587.
A056542(n) equals the row sums for n>=1.
A001710, A001715, A001720, A001725, A001730, A049388, A049389, A049398, A051431 are related to the left hand columns.
A000012, A009056, A002378, A007531, A052762, A052787, A053625 and A159083 are related to the right hand columns.

a162995 n k = a162995_tabl !! (n-1) !! (k-1)
a162995_row n = a162995_tabl !! (n-1)
a162995_tabl = map fst $ iterate f ([1], 3)
   where f (row, i) = (map (* i) row ++ [1], i + 1)
-- Reinhard Zumkeller, Jul 04 2012

a := proc(n, m): (n+1)!/(m+1)! end: seq(seq(a(n, m), m=1..n), n=1..9); # Johannes W. Meijer, revised Nov 23 2012

Table[(n+1)!/(m+1)!, {n, 10}, {m, n}] (* Paolo Xausa, Mar 31 2024 *)

a(n,m) = (n+1)!/(m+1)! for n = 1, 2, 3, ..., and m = 1, 2, ..., n.

A020739 a(n) = 2*n + 6.

Original entry on oeis.org

6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108, 110, 112, 114, 116, 118, 120, 122, 124, 126, 128, 130, 132, 134, 136, 138

Offset: 0

David W. Wilson

Pisot sequence T(6,8).

Trivial case of a Pisot sequence satisfying a simple linear recurrence. Here, since round((2*n+2)^2/(2*n)^2) = 2*n + round((n+1)/n^2) = 2*n for n > 2, a(n) is even and a(n) = a(n-1) + 2. - Ralf Stephan, Sep 03 2013

Tanya Khovanova, Recursive Sequences.
Index entries for linear recurrences with constant coefficients, signature (2,-1).

Subsequence of A005843. See A008776 for definitions of Pisot sequences.

Cf. A009056, A028557.

2*Range[0,70]+6 (* or *) Range[6,138,2] (* Harvey P. Dale, Apr 24 2017 *)

a(n) = 2*a(n-1) - a(n-2).
From Elmo R. Oliveira, Oct 30 2024: (Start)
G.f.: 2*(3 - 2*x)/(1 - x)^2.
E.g.f.: 2*exp(x)*(3 + x).
a(n) = 2*A009056(n+1) = A028557(n+1) - A028557(n). (End)

Better name from Ralf Stephan, Sep 03 2013

A099173 Array, A(k,n), read by diagonals: g.f. of k-th row x/(1-2x-(k-1)x^2).

Original entry on oeis.org

0, 0, 1, 0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 4, 4, 0, 1, 2, 5, 8, 5, 0, 1, 2, 6, 12, 16, 6, 0, 1, 2, 7, 16, 29, 32, 7, 0, 1, 2, 8, 20, 44, 70, 64, 8, 0, 1, 2, 9, 24, 61, 120, 169, 128, 9, 0, 1, 2, 10, 28, 80, 182, 328, 408, 256, 10, 0, 1, 2, 11, 32, 101, 256, 547, 896, 985, 512, 11

Offset: 0

Ralf Stephan, Oct 13 2004

			Square array, A(n, k), begins as:
  0, 1, 2,  3,  4,   5,    6,    7,     8, ... A001477;
  0, 1, 2,  4,  8,  16,   32,   64,   128, ... A000079;
  0, 1, 2,  5, 12,  29,   70,  169,   408, ... A000129;
  0, 1, 2,  6, 16,  44,  120,  328,   896, ... A002605;
  0, 1, 2,  7, 20,  61,  182,  547,  1640, ... A015518;
  0, 1, 2,  8, 24,  80,  256,  832,  2688, ... A063727;
  0, 1, 2,  9, 28, 101,  342, 1189,  4088, ... A002532;
  0, 1, 2, 10, 32, 124,  440, 1624,  5888, ... A083099;
  0, 1, 2, 11, 36, 149,  550, 2143,  8136, ... A015519;
  0, 1, 2, 12, 40, 176,  672, 2752, 10880, ... A003683;
  0, 1, 2, 13, 44, 205,  806, 3457, 14168, ... A002534;
  0, 1, 2, 14, 48, 236,  952, 4264, 18048, ... A083102;
  0, 1, 2, 15, 52, 269, 1110, 5179, 22568, ... A015520;
  0, 1, 2, 16, 56, 304, 1280, 6208, 27776, ... A091914;
Antidiagonal triangle, T(n, k), begins as:
  0;
  0,  1;
  0,  1,  2;
  0,  1,  2,  3;
  0,  1,  2,  4,  4;
  0,  1,  2,  5,  8,  5;
  0,  1,  2,  6, 12, 16,   6;
  0,  1,  2,  7, 16, 29,  32,   7;
  0,  1,  2,  8, 20, 44,  70,  64,   8;
  0,  1,  2,  9, 24, 61, 120, 169, 128,   9;
  0,  1,  2, 10, 28, 80, 182, 328, 408, 256,  10;

G. C. Greubel, Antidiagonals n = 0..50, flattened
Ralf Stephan, Prove or disprove. 100 Conjectures from the OEIS, #16, arXiv:math/0409509 [math.CO], 2004.

Rows m: A001477 (m=0), A000079 (m=1), A000129 (m=2), A002605 (m=3), A015518 (m=4), A063727 (m=5), A002532 (m=6), A083099 (m=7), A015519 (m=8), A003683 (m=9), A002534 (m=10), A083102 (m=11), A015520 (m=12), A091914 (m=13).
Columns q: A000004 (q=0), A000012 (q=1), A009056 (q=2), A008586 (q=3).
Main diagonal gives A357502.

A099173:= func< n,k | (&+[n^j*Binomial(k,2*j+1): j in [0..Floor(k/2)]]) >;
[A099173(n,k): k in [0..n], n in [0..12]]; // G. C. Greubel, Feb 17 2023

A[k_, n_]:= Which[k==0, n, n==0, 0, True, ((1+Sqrt[k])^n - (1-Sqrt[k])^n)/(2 Sqrt[k])]; Table[A[k-n, n]//Simplify, {k, 0, 12}, {n, 0, k}]//Flatten (* Jean-François Alcover, Jan 21 2019 *)

A(k,n)=sum(i=0,n\2,k^i*binomial(n,2*i+1))

def A099173(n,k): return sum( n^j*binomial(k, 2*j+1) for j in range((k//2)+1) )
flatten([[A099173(n,k) for k in range(n+1)] for n in range(13)]) # G. C. Greubel, Feb 17 2023

A(n, k) = Sum_{i=0..floor(k/2)} n^i * C(k, 2*i+1) (array).
Recurrence: A(n, k) = 2*A(n, k-1) + (n-1)*A(n, k-2), with A(n, 0) = 0, A(n, 1) = 1.
T(n, k) = A(n-k, k) (antidiagonal triangle).
T(2*n, n) = A357502(n).
A(n, k) = ((1+sqrt(n))^k - (1-sqrt(n))^k)/(2*sqrt(n)). - Jean-François Alcover, Jan 21 2019

cp's OEIS Frontend

A009005 All natural numbers except 1, 2 and 4.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A062253 2nd level triangle related to Eulerian numbers and binomial transforms (triangle of Eulerian numbers is first level and triangle with Z(0,0)=1 and Z(n,k)=0 otherwise is 0th level).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

PARI

Formula

Extensions

A162995 A scaled version of triangle A162990.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

Formula

A020739 a(n) = 2*n + 6.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A099173 Array, A(k,n), read by diagonals: g.f. of k-th row x/(1-2*x-(k-1)*x^2).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

SageMath

Formula

A099173 Array, A(k,n), read by diagonals: g.f. of k-th row x/(1-2x-(k-1)x^2).