Triangles Row Sum ConstantExponent

Squares 4, 9, 16, 25, ...

A002024 n appears n times; floor(sqrt(2n) + 1/2).

A052146 floor((sqrt(1+8*n)-3)/2).

A095026 Lower triangle T(j,k) read by rows, where T(j,k) is the number of occurrences of the digit k-1 as least significant digit in the base-j multiplication table.

A099375 Sequence matrix for odd numbers.

A110314 Inverse of number triangle related to Fibonacci numbers.

A115281 Correlation triangle for the sequence 2-0^n.

A127447 Triangle defined by the matrix product A127446 * A054521, read by rows 1<=k<=n.

A127466 Triangle read by rows: A054525 * A127481 as infinite lower triangular matrices.

A127649 A127648 * A054523 as infinite lower triangular matrices.

A127733 Square of A127648 = Triangle read by rows, n^2 preceded by (n-1) zeros.

A130270 Triangle read by rows, T(n) followed by 1,2,3,...(n-1).

A130302 A000012 * A130296.

A143595 Triangle read by rows, A000012 * (an infinite lower triangular matrix with 1's in the first column and the rest 2's); 1<=k<=n.

A158405 Triangle T(n,m) = 1+2*m of odd numbers read along rows, 0<=m<n.

A162593 Differences of squares: T(n,n)=n^2, T(n,k)=T(n,k+1)-T(n-1,k), 0<=k<n, triangle read by rows.

A169618 Table with T(n,k) = the number of ways to represent k as the sum of a square and a cube modulo n.

A194287 Triangular array: g(n,k)=number of fractional parts (i*sqrt(2)) in interval [(k-1)/n, k/n], for 1<=i<=n^2, 1<=k<=n.

A194291 Triangular array: g(n,k)=number of fractional parts (i*sqrt(3)) in interval [(k-1)/n, k/n], for 1<=i<=n^2, 1<=k<=n.

A194295 Triangular array: g(n,k)=number of fractional parts (i*r) in interval [(k-1)/n, k/n], for 1<=i<=n, 1<=k<=n^2, r=(1+sqrt(5))/2, the golden ratio.

A194299 Triangular array: g(n,k)=number of fractional parts (i*r) in interval [(k-1)/n, k/n], for 1<=i<=n^2, 1<=k<=n, r=(1+sqrt(3))/2.

A194303 Triangular array: g(n,k)=number of fractional parts (i*sqrt(5)) in interval [(k-1)/n, k/n], for 1<=i<=n^2, 1<=k<=n.

A194307 Triangular array: g(n,k)=number of fractional parts (i*pi) in interval [(k-1)/n, k/n], for 1<=i<=n^2, 1<=k<=n.

A194311 Triangular array: g(n,k)=number of fractional parts (i*e) in interval [(k-1)/n, k/n], for 1<=i<=n^2, 1<=k<=n.

A194315 Triangular array: g(n,k)=number of fractional parts (i*sqrt(6)) in interval [(k-1)/n, k/n], for 1<=i<=n^2, 1<=k<=n.

A194319 Triangular array: g(n,k)=number of fractional parts (i*sqrt(8)) in interval [(k-1)/n, k/n], for 1<=i<=n^2, 1<=k<=n.

A194323 Triangular array: g(n,k)=number of fractional parts (i*sqrt(1/2)) in interval [(k-1)/n, k/n], for 1<=i<=n^2, 1<=k<=n.

A194327 Triangular array: g(n,k)=number of fractional parts (i*r) in interval [(k-1)/n, k/n], for 1<=i<=n^2, 1<=k<=n, r=2-sqrt(2).

A194331 Triangular array: g(n,k)=number of fractional parts (i*r) in interval [(k-1)/n, k/n], for 1<=i<=n^2, 1<=k<=n, r=2-sqrt(3).

A194335 Triangular array: g(n,k)=number of fractional parts (i*r) in interval [(k-1)/n, k/n], for 1<=i<=n^2, 1<=k<=n, r=2-tau, where tau=(1+sqrt(5))/2, the golden ratio.

A194339 Triangular array: g(n,k)=number of fractional parts (i*r) in interval [(k-1)/n, k/n], for 1<=i<=n^2, 1<=k<=n, r=3-sqrt(5).

A194343 Triangular array: g(n,k)=number of fractional parts (i*r) in interval [(k-1)/n, k/n], for 1<=i<=n^2, 1<=k<=n, r=3-e.

A242114 Triangle read by rows: T(n,k) = number of pairs (x,y) in {1..n}X{1..n} with gcd(x,y) = k.

Cubes 8, 27, 64, 125, ...

A005408 The odd numbers: a(n) = 2n+1.

A079297 Triangle read by rows: the k-th column is an arithmetic progression with difference 2k-1 and the top entry is the hexagonal number k*(2*k-1) (A000384).

A093995 n^2 repeated n times, triangle read by rows.

A100667 Triangle read by rows: First row is special; for n > 1, n-th row consists of n distinct primes whose sum is n^3. Take the lexicographically earliest solution for each row.

A128225 A127899 (unsigned) * A004736.

A144396 The odd numbers greater than 1.

A157142 Signed denominators of Leibniz series for Pi/4

A176271 The odd numbers as a triangle read by rows.

partial match

A247328 Odd deficient numbers.

Fourth powers 16, 81, 256, 625, ...

A181107 Triangle of numbers T(n,k), made into a sequence by reading it row by row; T(n,k) is the number of 2x2 matrices over Z(n) having determinant congruent to k mod n ; 1<=n, k=0,1,...,n-1

A247327 Triangle read by rows: T(n,k) = sum of k-th row of n X n square filled with odd numbers 1 through 2*n^2-1 reading across rows left-to-right.