Sequences
392,541 sequences
- Triangle of coefficients of a companion polynomial to the Gandhi polynomial.A083061
Triangle of coefficients of a companion polynomial to the Gandhi polynomial.
- a(n) = (n+1)^n/(n+2) - (-1)^n/(n+2).A083062
a(n) = (n+1)^n/(n+2) - (-1)^n/(n+2).
- a(n) = (n+1)^(n-1)/(n+2) + (-1)^n/(n+2).A083063
a(n) = (n+1)^(n-1)/(n+2) + (-1)^n/(n+2).
- Square number array T(n,k) = (k*(k+2)^n+1)/(k+1) read by antidiagonals.A083064
Square number array T(n,k) = (k*(k+2)^n+1)/(k+1) read by antidiagonals.
- 4th row of number array A083064.A083065
4th row of number array A083064.
- 5th row of number array A083064.A083066
5th row of number array A083064.
- 6th row of number array A083064.A083067
6th row of number array A083064.
- 7th row of number array A083064.A083068
7th row of number array A083064.
- Main diagonal of number array A083064.A083069
Main diagonal of number array A083064.
- First superdiagonal of number array A083064.A083070
First superdiagonal of number array A083064.
- First subdiagonal of number array A083064.A083071
First subdiagonal of number array A083064.
- A subdiagonal of number array A083064.A083072
A subdiagonal of number array A083064.
- A subdiagonal of number array A083064.A083073
A subdiagonal of number array A083064.
- a(n) = n^3 - n^2 - n - 1.A083074
a(n) = n^3 - n^2 - n - 1.
- Square array read by antidiagonals: T(n,k) = (k*(2*k+3)^n + 1)/(k+1).A083075
Square array read by antidiagonals: T(n,k) = (k*(2*k+3)^n + 1)/(k+1).
- Third row of number array A083075.A083076
Third row of number array A083075.
- Fifth row of number array A083075.A083077
Fifth row of number array A083075.
- 6th row of number array A083075.A083078
6th row of number array A083075.
- 4th column of number array A083075.A083079
4th column of number array A083075.
- Main diagonal of number array A083075.A083080
Main diagonal of number array A083075.
- First superdiagonal of number array A083075.A083081
First superdiagonal of number array A083075.
- First subdiagonal of number array A083075.A083082
First subdiagonal of number array A083075.
- A diagonal of number array A083075.A083083
A diagonal of number array A083075.
- A diagonal of number array A083075.A083084
A diagonal of number array A083075.
- a(n) = (2+(-5)^n)/3.A083085
a(n) = (2+(-5)^n)/3.
- a(n) = (2^(n+1) + (-4)^n)/3.A083086
a(n) = (2^(n+1) + (-4)^n)/3.
- Square table read by antidiagonals which forms a permutation of the natural numbers: T(n,0) = floor(n*x/(x-1))+1, T(n,k+1) = ceiling(x*T(n,k)), for n>=0, k>=0, where x = 1 + sqrt(2).A083087
Square table read by antidiagonals which forms a permutation of the natural numbers: T(n,0) = floor(n*x/(x-1))+1, T(n,k+1) = ceiling(x*T(n,k)), for n>=0, k>=0, where x = 1 + sqrt(2).
- First column of table A083087.A083088
First column of table A083087.
- Numbers that are congruent to {0, 2, 4, 6, 7, 9, 11} mod 12.A083089
Numbers that are congruent to {0, 2, 4, 6, 7, 9, 11} mod 12.
- Main diagonal of table A083087.A083090
Main diagonal of table A083087.
- Antidiagonal sums of table A083087.A083091
Antidiagonal sums of table A083087.
- Numbers k such that 7*5^k + 2 is a prime.A083092
Numbers k such that 7*5^k + 2 is a prime.
- Triangle, read by rows, formed by reading Pascal's triangle (A007318) mod 3.A083093
Triangle, read by rows, formed by reading Pascal's triangle (A007318) mod 3.
- Numbers k such that Sum_{j=0..k} (binomial(k,j) mod 3) is odd.A083094
Numbers k such that Sum_{j=0..k} (binomial(k,j) mod 3) is odd.
- a(n) = A083094(n)/4.A083095
a(n) = A083094(n)/4.
- Numbers k such that 3 divides Sum_{j=1..k} binomial(2*j,j).A083096
Numbers k such that 3 divides Sum_{j=1..k} binomial(2*j,j).
- a(n) = A083096(n)/6.A083097
a(n) = A083096(n)/6.
- a(n) = 2*a(n-1) + 6*a(n-2).A083098
a(n) = 2*a(n-1) + 6*a(n-2).
- a(n) = 2*a(n-1) + 6*a(n-2), a(0) = 0, a(1) = 1.A083099
a(n) = 2*a(n-1) + 6*a(n-2), a(0) = 0, a(1) = 1.
- a(n) = 2*a(n-1) + 7*a(n-2).A083100
a(n) = 2*a(n-1) + 7*a(n-2).
- a(n) = 2*a(n-1) + 10*a(n-2), with a(0) = 1, a(1) = 12.A083101
a(n) = 2*a(n-1) + 10*a(n-2), with a(0) = 1, a(1) = 12.
- a(n) = 2*a(n-1) + 10*a(n-2), with a(0) = 1, a(1) = 2.A083102
a(n) = 2*a(n-1) + 10*a(n-2), with a(0) = 1, a(1) = 2.
- Second-order linear recurrence sequence with a(n) = a(n-1) + a(n-2), with initial terms 1786772701928802632268715130455793, 1059683225053915111058165141686995.A083103
Second-order linear recurrence sequence with a(n) = a(n-1) + a(n-2), with initial terms 1786772701928802632268715130455793, 1059683225053915111058165141686995.
- Second-order linear recurrence sequence with a(n) = a(n-1) + a(n-2), with initial terms 331635635998274737472200656430763, 1510028911088401971189590305498785.A083104
Second-order linear recurrence sequence with a(n) = a(n-1) + a(n-2), with initial terms 331635635998274737472200656430763, 1510028911088401971189590305498785.
- Second-order linear recurrence sequence with a(n) = a(n-1) + a(n-2), with initial terms 62638280004239857, 49463435743205655.A083105
Second-order linear recurrence sequence with a(n) = a(n-1) + a(n-2), with initial terms 62638280004239857, 49463435743205655.
- Triangle read by rows in which the n-th row contains n smallest numbers whose product == 1 mod n.A083106
Triangle read by rows in which the n-th row contains n smallest numbers whose product == 1 mod n.
- Diagonal of A083106.A083107
Diagonal of A083106.
- Product of terms in row n of A083106.A083108
Product of terms in row n of A083106.
- a(n) = (A083108(n) - 1)/n.A083109
a(n) = (A083108(n) - 1)/n.
- Triangle read by rows in which the n-th row contains lexicographically earliest increasing sequence of n positive integers whose product == -1 (mod n).A083110
Triangle read by rows in which the n-th row contains lexicographically earliest increasing sequence of n positive integers whose product == -1 (mod n).