Sequences
392,541 sequences
- Composite numbers k that divide both Fibonacci(k+1) and Fibonacci(k) + 1.A094411
Composite numbers k that divide both Fibonacci(k+1) and Fibonacci(k) + 1.
- Numbers k that divide Fibonacci(k+1) but do not divide Fibonacci(k) + 1.A094412
Numbers k that divide Fibonacci(k+1) but do not divide Fibonacci(k) + 1.
- Odd composites k that divide Fibonacci(k) + 1 but not Fibonacci(k+1).A094413
Odd composites k that divide Fibonacci(k) + 1 but not Fibonacci(k+1).
- Triangle T read by rows: dot product <1,2,...,r> * <s+1,s+2,...,r,1,2,...,s>.A094414
Triangle T read by rows: dot product <1,2,...,r> * <s+1,s+2,...,r,1,2,...,s>.
- Triangle T read by rows: dot product <r,r-1,...,1> * <s+1,s+2,...,r,1,2,...,s>.A094415
Triangle T read by rows: dot product <r,r-1,...,1> * <s+1,s+2,...,r,1,2,...,s>.
- Array read by antidiagonals: generalized ordered Bell numbers Bo(r,n).A094416
Array read by antidiagonals: generalized ordered Bell numbers Bo(r,n).
- Generalized ordered Bell numbers Bo(4,n).A094417
Generalized ordered Bell numbers Bo(4,n).
- Generalized ordered Bell numbers Bo(5,n).A094418
Generalized ordered Bell numbers Bo(5,n).
- Generalized ordered Bell numbers Bo(6,n).A094419
Generalized ordered Bell numbers Bo(6,n).
- Generalized ordered Bell numbers Bo(n,n).A094420
Generalized ordered Bell numbers Bo(n,n).
- a(n) = n * (6*n^2 + 6*n + 1).A094421
a(n) = n * (6*n^2 + 6*n + 1).
- Antidiagonal sums of array A094416.A094422
Antidiagonal sums of array A094416.
- a(n) = A045873(n)^2.A094423
a(n) = A045873(n)^2.
- Array read by antidiagonals: Solutions to Schmidt's Problem.A094424
Array read by antidiagonals: Solutions to Schmidt's Problem.
- Numbers n such that F_n(x) and F_n(1-x) have a common factor mod 2, with F_n(x) = U(n-1,x/2) the monic Chebyshev polynomials of second kind; this lists only the primitive elements of the set.A094425
Numbers n such that F_n(x) and F_n(1-x) have a common factor mod 2, with F_n(x) = U(n-1,x/2) the monic Chebyshev polynomials of second kind; this lists only the primitive elements of the set.
- Terms of A094302 without repetition.A094426
Terms of A094302 without repetition.
- Terms of A094302 which are not squarefree, without repetition.A094427
Terms of A094302 which are not squarefree, without repetition.
- Expansion of infinite product (q^12, q^12, q^6; q^5, q^7; q^12)_oo.A094428
Expansion of infinite product (q^12, q^12, q^6; q^5, q^7; q^12)_oo.
- Given the 3 X 3 matrix M = [0 1 0 / 0 0 1 / 7 -14 7], a(n) = (-) rightmost term of M^n * [1 1 1].A094429
Given the 3 X 3 matrix M = [0 1 0 / 0 0 1 / 7 -14 7], a(n) = (-) rightmost term of M^n * [1 1 1].
- a(n) is the rightmost term of M^n * [1 0 0], where M is the 3 X 3 matrix [0 1 0 / 0 0 1 / 7 -14 7].A094430
a(n) is the rightmost term of M^n * [1 0 0], where M is the 3 X 3 matrix [0 1 0 / 0 0 1 / 7 -14 7].
- a(n) = left term in M^n * [1 0 0], where M = the 3 X 3 matrix [1 -1 0 / -1 4 -3 / 0 -3 3].A094431
a(n) = left term in M^n * [1 0 0], where M = the 3 X 3 matrix [1 -1 0 / -1 4 -3 / 0 -3 3].
- a(n) = rightmost term in M^n * [1 0 0]. M = the 3 X 3 stiffness matrix [1 -1 0 / -1 4 -3 / 0 -3 3].A094432
a(n) = rightmost term in M^n * [1 0 0]. M = the 3 X 3 stiffness matrix [1 -1 0 / -1 4 -3 / 0 -3 3].
- a(n) is the left term in M^n * [1 0 0], M = the 3 X 3 matrix [1 -1 0 / -1 3 -2 / 0 -2 2].A094433
a(n) is the left term in M^n * [1 0 0], M = the 3 X 3 matrix [1 -1 0 / -1 3 -2 / 0 -2 2].
- a(n) = rightmost term of M^n * [1 0 0], with M = the 3 X 3 matrix [1 -1 0 / -1 3 -2 / 0 -2 2].A094434
a(n) = rightmost term of M^n * [1 0 0], with M = the 3 X 3 matrix [1 -1 0 / -1 3 -2 / 0 -2 2].
- Triangular array read by rows: T(n,k) = Fibonacci(k)*C(n,k), k = 1...n; n>=1.A094435
Triangular array read by rows: T(n,k) = Fibonacci(k)*C(n,k), k = 1...n; n>=1.
- Triangular array T(n,k) = Fibonacci(k+1)*binomial(n,k) for k = 0..n; n >= 0.A094436
Triangular array T(n,k) = Fibonacci(k+1)*binomial(n,k) for k = 0..n; n >= 0.
- Triangular array T(n,k) = Fibonacci(k+2)*C(n,k), k=0..n, n>=0.A094437
Triangular array T(n,k) = Fibonacci(k+2)*C(n,k), k=0..n, n>=0.
- Triangular array T(n,k) = Fibonacci(k+3)*C(n,k), k=0..n, n>=0.A094438
Triangular array T(n,k) = Fibonacci(k+3)*C(n,k), k=0..n, n>=0.
- Triangular array T(n,k) = Fibonacci(k+4)*C(n,k), k=0..n, n>=0.A094439
Triangular array T(n,k) = Fibonacci(k+4)*C(n,k), k=0..n, n>=0.
- Triangular array read by rows: T(n,k) = Fibonacci(n+1-k)*C(n,k-1), k = 1..n; n >= 1.A094440
Triangular array read by rows: T(n,k) = Fibonacci(n+1-k)*C(n,k-1), k = 1..n; n >= 1.
- Triangular array T(n,k) = Fibonacci(n+1-k)*C(n,k), 0 <= k <= n.A094441
Triangular array T(n,k) = Fibonacci(n+1-k)*C(n,k), 0 <= k <= n.
- Triangular array T(n,k) = Fibonacci(n+2-k)*C(n,k), 0 <= k <= n.A094442
Triangular array T(n,k) = Fibonacci(n+2-k)*C(n,k), 0 <= k <= n.
- Triangular array T(n,k) = Fibonacci(n+3-k)*C(n,k), k=0..n, n>=0.A094443
Triangular array T(n,k) = Fibonacci(n+3-k)*C(n,k), k=0..n, n>=0.
- Triangular array T(n,k) = Fibonacci(n+4-k)*C(n,k), k=0..n, n>=0.A094444
Triangular array T(n,k) = Fibonacci(n+4-k)*C(n,k), k=0..n, n>=0.
- Values of m satisfying Euler's rule.A094445
Values of m satisfying Euler's rule.
- Values of n satisfying Euler's rule.A094446
Values of n satisfying Euler's rule.
- Numbers which are the sum of two positive cubes and divisible by 13.A094447
Numbers which are the sum of two positive cubes and divisible by 13.
- Number of indecomposable groups of order 2^n.A094448
Number of indecomposable groups of order 2^n.
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n and having sum of pyramid heights equal to k.A094449
Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n and having sum of pyramid heights equal to k.
- Number of iterations of the sum of digits of the divisors of 10^n needed to reach 15.A094450
Number of iterations of the sum of digits of the divisors of 10^n needed to reach 15.
- a(n) = A033485(n) modulo 3.A094451
a(n) = A033485(n) modulo 3.
- Decimal expansion of Integral_{0..1} Integral_{0..1} binomial(x,y) dx dy.A094452
Decimal expansion of Integral_{0..1} Integral_{0..1} binomial(x,y) dx dy.
- Numbers k such that binomial(2*k, k)/(k+2) is not an integer.A094453
Numbers k such that binomial(2*k, k)/(k+2) is not an integer.
- First of 9 consecutive primes in a 3 X 3 spiral wherein the mean of all 8 sums is prime.A094454
First of 9 consecutive primes in a 3 X 3 spiral wherein the mean of all 8 sums is prime.
- Prime mean of 8 horizontal, vertical and main diagonal sums associated with primes in A094454.A094455
Prime mean of 8 horizontal, vertical and main diagonal sums associated with primes in A094454.
- Triangle T(n,k), 0<=k<=n, read by rows; given by [0, 1, 0, 2, 0, 3, 0, 4, 0, 5, 0, ...] DELTA [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...] where DELTA is the operator defined in A084938.A094456
Triangle T(n,k), 0<=k<=n, read by rows; given by [0, 1, 0, 2, 0, 3, 0, 4, 0, 5, 0, ...] DELTA [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...] where DELTA is the operator defined in A084938.
- a(n) is the largest number k < n in a neighborhood of n defined by prime factorization, specifically, A127185(n,k) <= 2.A094457
a(n) is the largest number k < n in a neighborhood of n defined by prime factorization, specifically, A127185(n,k) <= 2.
- Initial members of 25 consecutive primes in a 5 X 5 spiral wherein the mean of all 12 sums is prime.A094458
Initial members of 25 consecutive primes in a 5 X 5 spiral wherein the mean of all 12 sums is prime.
- Prime means of 12 horizontal, vertical and main diagonal sums associated with primes in A094458.A094459
Prime means of 12 horizontal, vertical and main diagonal sums associated with primes in A094458.
- a(n) is the third term in Euclid-Mullin (EM) prime sequence initiated with n-th prime.A094460
a(n) is the third term in Euclid-Mullin (EM) prime sequence initiated with n-th prime.