Sequences
392,541 sequences
- a(n) = Fibonacci(n) mod 12.A089911
a(n) = Fibonacci(n) mod 12.
- a(n) gives sum of number of common unitary divisors of n and m, where m runs from 1 to n.A089912
a(n) gives sum of number of common unitary divisors of n and m, where m runs from 1 to n.
- Table T(n,k) = lcm(n,k)/gcd(n,k) = n*k/gcd(n,k)^2 read by antidiagonals (n >= 1, k >= 1).A089913
Table T(n,k) = lcm(n,k)/gcd(n,k) = n*k/gcd(n,k)^2 read by antidiagonals (n >= 1, k >= 1).
- a(n) = 3^n *n! *L_{n}^{-1/3}(-1), where L_n^{alpha}(x) are generalized Laguerre polynomials.A089914
a(n) = 3^n *n! *L_{n}^{-1/3}(-1), where L_n^{alpha}(x) are generalized Laguerre polynomials.
- Special values of generalized Laguerre polynomials L_n^(alpha)(x): a(n) = 4^n *n! *L_n^(-1/4)(-1).A089915
Special values of generalized Laguerre polynomials L_n^(alpha)(x): a(n) = 4^n *n! *L_n^(-1/4)(-1).
- a(n) = 5^n *n! *L_n^{-1/5}(-1), where L_n^(alpha)(x) are generalized Laguerre polynomials.A089916
a(n) = 5^n *n! *L_n^{-1/5}(-1), where L_n^(alpha)(x) are generalized Laguerre polynomials.
- a(n) = 6^n *n! *L_n^{-1/6}(-1), where L_n^(alpha)(x) are generalized Laguerre polynomials.A089917
a(n) = 6^n *n! *L_n^{-1/6}(-1), where L_n^(alpha)(x) are generalized Laguerre polynomials.
- (n+1)*a(n) equals the (n+1)-th term of the n-th binomial transform of this sequence.A089918
(n+1)*a(n) equals the (n+1)-th term of the n-th binomial transform of this sequence.
- Numbers k such that 3^prime(k) - 2 is prime.A089919
Numbers k such that 3^prime(k) - 2 is prime.
- Indices of primes p such that 7^p - 2 is prime.A089920
Indices of primes p such that 7^p - 2 is prime.
- Duplicate of A056899.A089921
Duplicate of A056899.
- Largest odd number in the reverse concatenation of the first n consecutive odd numbers when that concatenation is prime.A089922
Largest odd number in the reverse concatenation of the first n consecutive odd numbers when that concatenation is prime.
- Duplicate of A100003.A089923
Duplicate of A100003.
- Number of plane partitions of n with 3 or more columns.A089924
Number of plane partitions of n with 3 or more columns.
- Number of commutative loops (quasigroups with an identity element) of order n.A089925
Number of commutative loops (quasigroups with an identity element) of order n.
- a(n) = 12*a(n-1) + a(n-2), a(0)=1, a(1)=6.A089926
a(n) = 12*a(n-1) + a(n-2), a(0)=1, a(1)=6.
- Expansion of 1/((1-x^2)(1-5x+x^2)).A089927
Expansion of 1/((1-x^2)(1-5x+x^2)).
- a(n) = 2*a(n-1) + 2*a(n-3) + a(n-4), with a(0)=1, a(1)=2, a(3)=4, a(4)=10.A089928
a(n) = 2*a(n-1) + 2*a(n-3) + a(n-4), with a(0)=1, a(1)=2, a(3)=4, a(4)=10.
- Algebraic degree of cot(Pi/n).A089929
Algebraic degree of cot(Pi/n).
- Primes p such that there exists a set of consecutive primes ending with p which has the same sum as a set starting right after p.A089930
Primes p such that there exists a set of consecutive primes ending with p which has the same sum as a set starting right after p.
- a(n) = 3*a(n-1) + 3*a(n-3) + a(n-4).A089931
a(n) = 3*a(n-1) + 3*a(n-3) + a(n-4).
- G.f.: (1-x)^5/((-1+4*x-3*x^2+x^3)*(1-3*x+x^2)*(-1+2*x)).A089932
G.f.: (1-x)^5/((-1+4*x-3*x^2+x^3)*(1-3*x+x^2)*(-1+2*x)).
- Concatenate the first n odd primes.A089933
Concatenate the first n odd primes.
- Table T(n,k) of the number of n X k matrices on {0,1} without adjacent 0's in any row or column.A089934
Table T(n,k) of the number of n X k matrices on {0,1} without adjacent 0's in any row or column.
- a(n) = order of recurrence generating row (or column) n of A089934.A089935
a(n) = order of recurrence generating row (or column) n of A089934.
- Number of 5 X n matrices with entries {0,1} without adjacent 0's in any row or column. 5th row of A089934.A089936
Number of 5 X n matrices with entries {0,1} without adjacent 0's in any row or column. 5th row of A089934.
- Number of 6 X n matrices with entries {0,1} without adjacent 0's in any row or column. 6th row of A089934.A089937
Number of 6 X n matrices with entries {0,1} without adjacent 0's in any row or column. 6th row of A089934.
- Number of 7 X n matrices with entries {0,1} without adjacent 0's in any row or column. 7th row of A089934.A089938
Number of 7 X n matrices with entries {0,1} without adjacent 0's in any row or column. 7th row of A089934.
- T(i,j) = 1 if F(i) AND F(j) = 0, otherwise 0, where F is A003714 and AND is the bitwise logical-and operation. Table read by antidiagonals.A089939
T(i,j) = 1 if F(i) AND F(j) = 0, otherwise 0, where F is A003714 and AND is the bitwise logical-and operation. Table read by antidiagonals.
- Triangle read by rows: T(n,k)=binomial(n+k,floor((n-k)/2)).A089940
Triangle read by rows: T(n,k)=binomial(n+k,floor((n-k)/2)).
- Row sums of triangle A089940.A089941
Row sums of triangle A089940.
- Inverse binomial matrix applied to A039599.A089942
Inverse binomial matrix applied to A039599.
- Number of digits in candidates Sierpiński numbers of the first kind.A089943
Number of digits in candidates Sierpiński numbers of the first kind.
- Square array, read by antidiagonals, where the n-th row is the n-th binomial transform of the natural numbers, with T(0,k) = (k+1) for k>=0.A089944
Square array, read by antidiagonals, where the n-th row is the n-th binomial transform of the natural numbers, with T(0,k) = (k+1) for k>=0.
- Main diagonal of array A089944, in which the n-th row is the n-th binomial transform of the natural numbers.A089945
Main diagonal of array A089944, in which the n-th row is the n-th binomial transform of the natural numbers.
- Secondary diagonal of array A089944, in which the n-th row is the n-th binomial transform of the natural numbers.A089946
Secondary diagonal of array A089944, in which the n-th row is the n-th binomial transform of the natural numbers.
- G.f.: (1-x)^9/((1-5*x+6*x^2-4*x^3+x^4)*(-1+4*x-3*x^2+x^3)*(1-3*x+x^2)*(-1+2*x)).A089947
G.f.: (1-x)^9/((1-5*x+6*x^2-4*x^3+x^4)*(-1+4*x-3*x^2+x^3)*(1-3*x+x^2)*(-1+2*x)).
- Smallest prime factor of the concatenation of the first n odd primes.A089948
Smallest prime factor of the concatenation of the first n odd primes.
- Triangle T(n,k), read by rows, given by [0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, ...] DELTA [1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, ...] where DELTA is the operator defined in A084938.A089949
Triangle T(n,k), read by rows, given by [0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, ...] DELTA [1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, ...] where DELTA is the operator defined in A084938.
- Partial sums of A001652.A089950
Partial sums of A001652.
- Numbers having the same leading decimal digits as their squares.A089951
Numbers having the same leading decimal digits as their squares.
- Numbers n such that n+1 and phi(n)+1 are both perfect squares.A089952
Numbers n such that n+1 and phi(n)+1 are both perfect squares.
- Numbers n such that 3*n+7 is prime.A089953
Numbers n such that 3*n+7 is prime.
- Numbers k such that k+1 and sigma(k)+1 are both perfect squares.A089954
Numbers k such that k+1 and sigma(k)+1 are both perfect squares.
- Number of embedded Fibonacci numbers within the n-th Fibonacci number.A089955
Number of embedded Fibonacci numbers within the n-th Fibonacci number.
- Number of chess games that end in check (but not checkmate) after exactly n plies.A089956
Number of chess games that end in check (but not checkmate) after exactly n plies.
- Number of chess positions that can be obtained in exactly one way in n plies.A089957
Number of chess positions that can be obtained in exactly one way in n plies.
- Number of partitions of n in which every part occurs 2, 3, or 5 times.A089958
Number of partitions of n in which every part occurs 2, 3, or 5 times.
- a(n) = floor(1/(f(n) - f(n)^2)) with f(n) = frac(n*(sqrt(5) - 1)/2) (fractional part).A089959
a(n) = floor(1/(f(n) - f(n)^2)) with f(n) = frac(n*(sqrt(5) - 1)/2) (fractional part).
- Positions in A089959 where 4 occurs.A089960
Positions in A089959 where 4 occurs.