Sequences
392,541 sequences
- Final decimal digit of floor(Pi*n), Pi=3.1415...A094561
Final decimal digit of floor(Pi*n), Pi=3.1415...
- Initial decimal digit of fractional part of Pi*n, Pi=3.1415...A094562
Initial decimal digit of fractional part of Pi*n, Pi=3.1415...
- Triple products of Fibonacci numbers: F(i)*F(j)*F(k), 2 <= i <= j <= k.A094563
Triple products of Fibonacci numbers: F(i)*F(j)*F(k), 2 <= i <= j <= k.
- Triple products of distinct Fibonacci numbers: F(i)F(j)F(k), 2<=i<j<k.A094564
Triple products of distinct Fibonacci numbers: F(i)F(j)F(k), 2<=i<j<k.
- Triangle read by rows: binary products of Fibonacci numbers.A094565
Triangle read by rows: binary products of Fibonacci numbers.
- Triangle of binary products of Fibonacci numbers.A094566
Triangle of binary products of Fibonacci numbers.
- Associated with alternating row sums of array in A094566.A094567
Associated with alternating row sums of array in A094566.
- Triangle of binary products of Fibonacci numbers.A094568
Triangle of binary products of Fibonacci numbers.
- Associated with alternating row sums of array in A094568.A094569
Associated with alternating row sums of array in A094568.
- Triangle T(n,k) read by rows: T(n,k) = F(k) + F(n-k) where F(n) is the n-th Fibonacci number.A094570
Triangle T(n,k) read by rows: T(n,k) = F(k) + F(n-k) where F(n) is the n-th Fibonacci number.
- Triangle of binary sums of squares of Fibonacci numbers.A094571
Triangle of binary sums of squares of Fibonacci numbers.
- Number of pairs of integers x, y (of either sign) with x^2 - y^2 = n.A094572
Number of pairs of integers x, y (of either sign) with x^2 - y^2 = n.
- Triangle T(n,k) giving number of (<=2)-covers of an n-set with k blocks.A094573
Triangle T(n,k) giving number of (<=2)-covers of an n-set with k blocks.
- Number of (<=2)-covers of an n-set.A094574
Number of (<=2)-covers of an n-set.
- Numbers k with property that binomial(2k, k) / (k-1) is an integer.A094575
Numbers k with property that binomial(2k, k) / (k-1) is an integer.
- Numbers k with property that binomial(2k, k) / (k-2) is an integer.A094576
Numbers k with property that binomial(2k, k) / (k-2) is an integer.
- Central Peirce numbers. Number of set partitions of {1,2,..,2n+1} in which n+1 is the smallest of its block.A094577
Central Peirce numbers. Number of set partitions of {1,2,..,2n+1} in which n+1 is the smallest of its block.
- A094559/4.A094578
A094559/4.
- Duplicate of A029729.A094579
Duplicate of A029729.
- In decimal expansion of Pi=3.1415...: smallest k > n such that the k-th digit equals the n-th digit.A094580
In decimal expansion of Pi=3.1415...: smallest k > n such that the k-th digit equals the n-th digit.
- In decimal expansion of Pi=3.1415...: smallest k > 0 such that the (n+k)-th digit equals the n-th digit.A094581
In decimal expansion of Pi=3.1415...: smallest k > 0 such that the (n+k)-th digit equals the n-th digit.
- In decimal expansion of Pi=3.1415... : smallest k such that the (k+n)-th position equals the k-th position.A094582
In decimal expansion of Pi=3.1415... : smallest k such that the (k+n)-th position equals the k-th position.
- Erroneous version of A002058.A094583
Erroneous version of A002058.
- Dot product of (1,2,...,n) and first n distinct Fibonacci numbers.A094584
Dot product of (1,2,...,n) and first n distinct Fibonacci numbers.
- Triangle T of all positive differences of distinct Fibonacci numbers; also, triangle of all sums of consecutive distinct Fibonacci numbers.A094585
Triangle T of all positive differences of distinct Fibonacci numbers; also, triangle of all sums of consecutive distinct Fibonacci numbers.
- Central numbers of the triangle T of all positive differences of distinct Fibonacci numbers.A094586
Central numbers of the triangle T of all positive differences of distinct Fibonacci numbers.
- Triangle of permutation coefficients arranged with 1's on the diagonal. Also, triangle of permutations on n letters with exactly k+1 cycles and with the first k+1 letters in separate cycles.A094587
Triangle of permutation coefficients arranged with 1's on the diagonal. Also, triangle of permutations on n letters with exactly k+1 cycles and with the first k+1 letters in separate cycles.
- a(n) = n*F(n-1) + F(n), where F = A000045.A094588
a(n) = n*F(n-1) + F(n), where F = A000045.
- a(1) = 1; a(n+1) = a(n) + (largest element of {a} <= n).A094589
a(1) = 1; a(n+1) = a(n) + (largest element of {a} <= n).
- a(1) = 1; a(n+1) = a(n) * k(n), where k(n) is the number of elements of {a(j)}, 1<=j<=n, which are <= n.A094590
a(1) = 1; a(n+1) = a(n) * k(n), where k(n) is the number of elements of {a(j)}, 1<=j<=n, which are <= n.
- a(0) = 1; a(n) = n + (largest element of {a} <= n).A094591
a(0) = 1; a(n) = n + (largest element of {a} <= n).
- a(n)=1/det(M(n)) where M(n) is the n X n matrix with element 1/binomial(n+i+j,n).A094592
a(n)=1/det(M(n)) where M(n) is the n X n matrix with element 1/binomial(n+i+j,n).
- a(n) = (p-1)/x, where p = prime(n) and x = ord(3,p), the smallest positive integer such that 3^x == 1 mod p.A094593
a(n) = (p-1)/x, where p = prime(n) and x = ord(3,p), the smallest positive integer such that 3^x == 1 mod p.
- Total number of edges in all connected labeled graphs on n nodes.A094594
Total number of edges in all connected labeled graphs on n nodes.
- Number of solutions to 1 == nxy (mod z) == nyz (mod x) == nzx (mod y) with 0 < x < y < z.A094595
Number of solutions to 1 == nxy (mod z) == nyz (mod x) == nzx (mod y) with 0 < x < y < z.
- Number of solutions to the Lebesgue-Nagell equation x^2 + n = y^k with k > 2.A094596
Number of solutions to the Lebesgue-Nagell equation x^2 + n = y^k with k > 2.
- Number of solutions to the Lebesgue-Nagell equation x^2 + n = y^k with k > 2 and unique x.A094597
Number of solutions to the Lebesgue-Nagell equation x^2 + n = y^k with k > 2 and unique x.
- Numbers n such that the Lebesgue-Nagell equation x^2 + n = y^k, with k > 2, has no integer solutions.A094598
Numbers n such that the Lebesgue-Nagell equation x^2 + n = y^k, with k > 2, has no integer solutions.
- Numbers n such that the Lebesgue-Nagell equation x^2 + n = y^k, with k > 2, has an integer solution.A094599
Numbers n such that the Lebesgue-Nagell equation x^2 + n = y^k, with k > 2, has an integer solution.
- G.f. satisfies: a(2*n) equals coefficient of x^n in A(x)^(n+1) and a(2*n+1) equals coefficient of x^(n+1) in A(x)^(n+1), for n>=0, with a(0)=1.A094600
G.f. satisfies: a(2*n) equals coefficient of x^n in A(x)^(n+1) and a(2*n+1) equals coefficient of x^(n+1) in A(x)^(n+1), for n>=0, with a(0)=1.
- G.f. satisfies: A(x) = F(x*A(x)), where F(x) is the g.f. of A094600.A094601
G.f. satisfies: A(x) = F(x*A(x)), where F(x) is the g.f. of A094600.
- Total number of edges in all connected unlabeled graphs on n nodes.A094602
Total number of edges in all connected unlabeled graphs on n nodes.
- a(n) is the length of the maximal sequence of rightmost black cells in the n-th row of Rule 30 (begun from an initial black cell).A094603
a(n) is the length of the maximal sequence of rightmost black cells in the n-th row of Rule 30 (begun from an initial black cell).
- Largest number (up to that point) of consecutive rightmost black cells in the rows of Rule 30 (begun from an initial black cell). a(n) = b(2^n), where b(m) is sequence A094603.A094604
Largest number (up to that point) of consecutive rightmost black cells in the rows of Rule 30 (begun from an initial black cell). a(n) = b(2^n), where b(m) is sequence A094603.
- a(n) is the period of the n-th diagonal, from the right, of Rule 30 (begun from an initial black cell).A094605
a(n) is the period of the n-th diagonal, from the right, of Rule 30 (begun from an initial black cell).
- Base-2 logarithm of A094605.A094606
Base-2 logarithm of A094605.
- Rectangular array T by antidiagonals: row n consists of the positive integers k for which there are exactly n sets of Fibonacci numbers whose sum is k.A094607
Rectangular array T by antidiagonals: row n consists of the positive integers k for which there are exactly n sets of Fibonacci numbers whose sum is k.
- Rectangular array T by antidiagonals: row n consists of ranks of n in A000119.A094608
Rectangular array T by antidiagonals: row n consists of ranks of n in A000119.
- Numbers n such that n concatenated with n+1 is triangular.A094609
Numbers n such that n concatenated with n+1 is triangular.
- Number of unlabeled 4-gonal 2-trees with n 4-gons.A094610
Number of unlabeled 4-gonal 2-trees with n 4-gons.