Skip to content

Summary of block A144

96 sequences
  • A144046: Numbers n such that |n!-107| and |n!+107| are prime.

  • A144065: Values of k such that the expression sqrt(4!*(k+1) + 1) yields an integer.

  • A144075: Duplicate of A008621.

  • A144110: Period 6: repeat [2, 2, 2, 1, 1, 1].

  • A144128: Chebyshev U(n,x) polynomial evaluated at x=18.

  • A144129: a(n) = ChebyshevT(3, n).

  • A144130: a(n) = ChebyshevT(4, n).

  • A144138: Chebyshev polynomial of the second kind U(3,n).

  • A144139: Chebyshev polynomial of the second kind U(4,n).

  • A144193: Square array (5 X 5) read by rows.

  • A144222: Floor of the volumes of the first sixteen Lobell polyhedra.

  • A144298: Number of cycles of length 3 in the queen graph associated with an n X n chessboard.

  • A144312: a(n) = 5*n*(5*n + 1)/2.

  • A144314: a(n) = 3*n*(6*n + 1).

  • A144328: A002260 preceded by a column of 1’s: a (1, 1, 2, 3, 4, 5, …) crescendo triangle by rows.

  • A144335: Row sums of triangle A144334, binomial transform of [1, 2, 6, 7, 3, 0, 0, 0, …].

  • A144390: a(n) = 3*n^2 - n - 1.

  • A144391: a(n) = 3*n^2 + n - 1.

  • A144396: The odd numbers greater than 1.

  • A144410: a(n) = 4*(3*n+1)*(3*n+2).

  • A144414: a(n) = 2*(4^n - 1)/3 - n.

  • A144429: Starts 1 2 3 then successive terms have differences 1 2 3.

  • A144430: a(n) = 1 + A144429(n).

  • A144433: Multiples of 8 interleaved with the sequence of odd numbers >= 3.

  • A144437: Period 3: repeat [3, 3, 1].

  • A144449: a(n) = 4*(4 + 9*n^2 + 15*n).

  • A144459: a(n) = (3*n+1)*(5*n+1).

  • A144465: a(n) = 5^n - 2^(n - 1) for n > 0; a(0) = 1.

  • A144468: Final digit of multiples of 7.

  • A144473: A triangle sequence of determinants: a(n)=If[Mod[n, 3] == 0, 1, If[Mod[n, 3] == 1, -1, If[Mod[n, 3] == 2, 0]]]; b(n,m)=If[m < n && Mod[n, 3] == 0, 0, If[m < n && Mod[n, 3] == 1, 0, If[m < n && Mod[n, 3] == 2 && Mod[n, 2] == 0, 1, If[m < n && Mod[n, 3] == 2 && Mod[n, 2] == 1, -1, If[m == n, -1, 0]]]]]; M={{a(m), b(n, m)}, {a(n), b(n, n)}}; t(n,m)=Det[M].

  • A144478: Period 9: repeat 1,0,5,7,6,2,4,3,8.

  • A144479: a(0)=1, a(1)=3, a(n) = 8*a(n-1) - a(n-2).

  • A144481: a(n) = A078371(n-1) mod 9.

  • A144483: A144481(4n-3).

  • A144495: Row 2 of array in A144502.

  • A144530: Final diagonal of triangle in A144529.

  • A144535: Numerators of continued fraction convergents to sqrt(3)/2.

  • A144555: a(n) = 14*n^2.

  • A144560: Ten times hexagonal numbers: 10*n*(2*n-1).

  • A144595: Christoffel word of slope 4/7.

  • A144596: Christoffel word of slope 2/7.

  • A144597: Christoffel word of slope 3/7.

  • A144598: Christoffel word of slope 5/7.

  • A144599: Christoffel word of slope 6/7.

  • A144600: Christoffel word of slope 2/11.

  • A144601: Christoffel word of slope 3/11.

  • A144603: Christoffel word of slope 5/11.

  • A144604: Christoffel word of slope 6/11.

  • A144605: Christoffel word of slope 7/11.

  • A144606: Christoffel word of slope 8/11.

  • A144607: Christoffel word of slope 9/11.

  • A144608: Christoffel word of slope 10/11.

  • A144619: a(n) = 19*n + 8.

  • A144640: Row sums from A144562.

  • A144657: a(n) = Sum_{j = 1..n} Sum_{i = 1..n} (i + j)! / (i! * j!).

  • A144677: Related to enumeration of quantum states (see reference for precise definition).

  • A144678: Related to enumeration of quantum states (see reference for precise definition).

  • A144704: a(n) = 4^n*(1-2*n).

  • A144706: Central coefficients of the triangle A132047.

  • A144708: a(n) = 6^n * (1-4*n).

  • A144720: a(0) = 2, a(1) = 3, a(n) = 4 * a(n-1) - a(n-2).

  • A144721: a(0) = 2, a(1) = 5, a(n) = 4 * a(n-1) - a(n-2).

  • A144739: 7-factorial numbers A114799(7*n+3): Partial products of A017017(k) = 7*k+3, a(0) = 1.

  • A144743: Recurrence sequence a(n)=a(n-1)^2-a(n-1)-1, a(0)=3.

  • A144744: Recurrence sequence a(n)=a(n-1)^2-a(n-1)-1, a(0)=4.

  • A144745: Recurrence sequence a(n)=a(n-1)^2-a(n-1)-1, a(0)=9.

  • A144746: a(n) = a(n-1)^2 - a(n-1) - 1, a(0)=6.

  • A144747: Recurrence sequence a(n)=a(n-1)^2-a(n-1)-1, a(0)=7.

  • A144748: Recurrence sequence a(n)=a(n-1)^2-a(n-1)-1, a(0)=8.

  • A144756: Partial products of successive terms of A017101; a(0)=1 .

  • A144758: Partial products of successive terms of A017197.

  • A144768: a(n) = n! - n^9.

  • A144772: Duplicate of A045756.

  • A144773: 10-fold factorials: Product_{k=0..n-1} (10*k+1).

  • A144779: Variant of Sylvester’s sequence: a(n+1) = a(n)^2 - a(n) + 1, with a(1) = 5.

  • A144780: Variant of Sylvester’s sequence: a(n+1) = a(n)^2 - a(n) + 1, with a(1) = 6.

  • A144781: Variant of Sylvester’s sequence: a(n+1) = a(n)^2 - a(n) + 1, with a(1) = 8.

  • A144782: Variant of Sylvester’s sequence: a(n+1) = a(n)^2 - a(n) + 1, with a(1) = 9.

  • A144783: Variant of Sylvester’s sequence: a(n+1) = a(n)^2 - a(n) + 1, with a(1) = 10.

  • A144784: Variant of Sylvester’s sequence: a(n+1) = a(n)^2 - a(n) + 1, with a(1) = 11.

  • A144785: Variant of Sylvester’s sequence: a(n+1) = a(n)^2 - a(n) + 1, with a(1) = 12.

  • A144787: Recurrence sequence a(n+1)=a(n)^3-a(n)+1 and a(1)=2.

  • A144788: a(n+1) = a(n)^3 - a(n) + 1 with a(1) = 3.

  • A144827: Partial products of successive terms of A017029; a(0)=1.

  • A144828: Partial products of successive terms of A017113; a(0)=1.

  • A144829: Partial products of successive terms of A017209; a(0)=1 .

  • A144836: a(n) = round(phi^(4^n)) where phi is the golden ratio (A001622).

  • A144843: a(n) = (6^n - 2^n)^2 / 16.

  • A144844: a(n) = ((2 + sqrt(2))^n - (2 - sqrt(2))^n)^2/8.

  • A144863: Start with 1, then at each step prepend 10 and append 01.

  • A144864: a(n) = (4*16^(n-1)-1)/3.

  • A144876: Maximal number of distinct polyominoes into which an n X n square can be divided.

  • A144917: a(n) is the maximal odd value attained by A144916(n).

  • A144930: Numbers k arising in A144929.

  • A144945: Number of ways to place 2 queens on an n X n chessboard so that they attack each other.

  • A144965: a(n) = 4*n*(4*n^2 + 1).