Sequences
392,541 sequences
- Coefficients of the polynomials in the numerator of the generating function x/(1-x-x^2) for the Fibonacci sequence and its successive derivatives starting with the constant.A079461
Coefficients of the polynomials in the numerator of the generating function x/(1-x-x^2) for the Fibonacci sequence and its successive derivatives starting with the constant.
- Nonzero coefficients of the polynomials in the numerator of the generating function x/(1-x-x^2) for the Fibonacci sequence and its successive derivatives starting with the constant.A079462
Nonzero coefficients of the polynomials in the numerator of the generating function x/(1-x-x^2) for the Fibonacci sequence and its successive derivatives starting with the constant.
- Numbers k such that C(6*k,n)/(5*k+1) (A002295) is not divisible by 6.A079463
Numbers k such that C(6*k,n)/(5*k+1) (A002295) is not divisible by 6.
- Numbers k such that the "inventory" A063850 of k is prime.A079464
Numbers k such that the "inventory" A063850 of k is prime.
- Numbers k such that the "inventory" A063850 of k is a perfect square.A079465
Numbers k such that the "inventory" A063850 of k is a perfect square.
- Numbers k such that the "inventory" A063850 of k is a palindrome.A079466
Numbers k such that the "inventory" A063850 of k is a palindrome.
- Marks on lexicographically earliest 16-mark optimal Golomb ruler.A079467
Marks on lexicographically earliest 16-mark optimal Golomb ruler.
- Number of unlabeled and connected graphs on n vertices which have no induced subgraph isomorphic to the 'fork' (fork = 4 vertices forming a path with a fifth vertex adjacent only to one of the non-end vertices).A079468
Number of unlabeled and connected graphs on n vertices which have no induced subgraph isomorphic to the 'fork' (fork = 4 vertices forming a path with a fifth vertex adjacent only to one of the non-end vertices).
- Number of unlabeled and connected graphs on n vertices which are semi-P4-sparse (G is semi-P4-sparse iff G has no induced P5, House, or complement of a fork).A079469
Number of unlabeled and connected graphs on n vertices which are semi-P4-sparse (G is semi-P4-sparse iff G has no induced P5, House, or complement of a fork).
- Primes with prime inventory number (as in A063850).A079470
Primes with prime inventory number (as in A063850).
- Fixed points of reversed binary words in reversed lexicographic order.A079471
Fixed points of reversed binary words in reversed lexicographic order.
- Number of perfect matchings on an n X n L-shaped graph.A079472
Number of perfect matchings on an n X n L-shaped graph.
- Number of prime graphs on n vertices. (G is prime iff G has no module. Modules are also called homogeneous sets.)A079473
Number of prime graphs on n vertices. (G is prime iff G has no module. Modules are also called homogeneous sets.)
- Triangular array: for s=0 to r-1, a(r,s) = p(s)^(r-s), where p(s) is the s-th primorial number. (p(0)=1, p(1)=2, p(2)=2*3, p(3)=2*3*5,...).A079474
Triangular array: for s=0 to r-1, a(r,s) = p(s)^(r-s), where p(s) is the s-th primorial number. (p(0)=1, p(1)=2, p(2)=2*3, p(3)=2*3*5,...).
- Number described by n using the "Look and Say" rule.A079475
Number described by n using the "Look and Say" rule.
- First prime greater than or equal to phi(n^2).A079476
First prime greater than or equal to phi(n^2).
- First prime after phi(prime(n)^2).A079477
First prime after phi(prime(n)^2).
- Coefficient of x^0 in P(n,x) = (Product_{i=0..n-1} i!^2)/matdet(M(n)) of degree n^2 where M(n) is the n X n matrix m(i,j) = 1/(i+j+x).A079478
Coefficient of x^0 in P(n,x) = (Product_{i=0..n-1} i!^2)/matdet(M(n)) of degree n^2 where M(n) is the n X n matrix m(i,j) = 1/(i+j+x).
- Denominator of number J(n) arising in computation of second moment of A*_n lattice.A079479
Denominator of number J(n) arising in computation of second moment of A*_n lattice.
- a(1) = 1; a(2) = 2; a(n) = LS(a(n-1)) + LS(a(n-2)) if n > 2, where LS(m) = the "Look and Say" description (A045918) of m.A079480
a(1) = 1; a(2) = 2; a(n) = LS(a(n-1)) + LS(a(n-2)) if n > 2, where LS(m) = the "Look and Say" description (A045918) of m.
- Primes prime(k) such that prime(k)*prime(k+1)+(prime(k)-1)! is prime.A079481
Primes prime(k) such that prime(k)*prime(k+1)+(prime(k)-1)! is prime.
- Smallest number k such that k and k+1 have n and n+1 distinct prime divisors.A079482
Smallest number k such that k and k+1 have n and n+1 distinct prime divisors.
- Array read by rows in which n-th row lists the periodic part of the base-n expansion of 1/7.A079483
Array read by rows in which n-th row lists the periodic part of the base-n expansion of 1/7.
- a(n) = (2n-1)!! * (2n+1)!!, where the double factorial is A006882.A079484
a(n) = (2n-1)!! * (2n+1)!!, where the double factorial is A006882.
- Number of chess games that end in checkmate after exactly n plies.A079485
Number of chess games that end in checkmate after exactly n plies.
- Number of different solutions to a variant of the 3-ball tennis ball problem.A079486
Number of different solutions to a variant of the 3-ball tennis ball problem.
- Triangle read by rows giving Whitney numbers T(n,k) of Fibonacci lattices.A079487
Triangle read by rows giving Whitney numbers T(n,k) of Fibonacci lattices.
- Number of prime divisors (counted with multiplicity) of A138613(n).A079488
Number of prime divisors (counted with multiplicity) of A138613(n).
- a(n) = (2*4^n*binomial(2*n, n) - binomial(4*n + 1, 2*n)) / (n + 1).A079489
a(n) = (2*4^n*binomial(2*n, n) - binomial(4*n + 1, 2*n)) / (n + 1).
- Exp(n) is closer to an integer than any previous exp(k) for 1 <= k < n.A079490
Exp(n) is closer to an integer than any previous exp(k) for 1 <= k < n.
- Numerator of Sum_{k=0..n} binomial(n,k)/2^(k*(k-1)/2).A079491
Numerator of Sum_{k=0..n} binomial(n,k)/2^(k*(k-1)/2).
- Nearest integer to Sum_{k=0..n} binomial(n,k)/2^(k*(k-1)/2).A079492
Nearest integer to Sum_{k=0..n} binomial(n,k)/2^(k*(k-1)/2).
- Duplicate of A080020.A079493
Duplicate of A080020.
- Number of words of weight n in the free central groupoid on one generator.A079494
Number of words of weight n in the free central groupoid on one generator.
- Numbers k such that the sum of the squares of the digits of k in base 3 is 0 (mod 3).A079495
Numbers k such that the sum of the squares of the digits of k in base 3 is 0 (mod 3).
- a(0) = a(1) = 1; thereafter a(2*n+1) = 2*a(2*n) - a(2*n-1), a(2*n) = 4*a(2*n-1) - a(2*n-2).A079496
a(0) = a(1) = 1; thereafter a(2*n+1) = 2*a(2*n) - a(2*n-1), a(2*n) = 4*a(2*n-1) - a(2*n-2).
- a(1)=1; for n > 2, a(n) is the smallest integer > a(n-1) such that frac(sqrt(5)*a(n)) < frac(sqrt(5)*a(n-1)).A079497
a(1)=1; for n > 2, a(n) is the smallest integer > a(n-1) such that frac(sqrt(5)*a(n)) < frac(sqrt(5)*a(n-1)).
- Numbers whose sum of digits in base b gives 0 (mod b), for b = 3.A079498
Numbers whose sum of digits in base b gives 0 (mod b), for b = 3.
- Total number of parts in all partitions of n into distinct odd parts.A079499
Total number of parts in all partitions of n into distinct odd parts.
- Number of compositions of the integer n in which the first part is >= the other parts.A079500
Number of compositions of the integer n in which the first part is >= the other parts.
- Number of compositions of the integer n with strictly smallest part in the first position.A079501
Number of compositions of the integer n with strictly smallest part in the first position.
- Triangle T(n,k) read by rows; related to number of preorders.A079502
Triangle T(n,k) read by rows; related to number of preorders.
- a(n) = (n-1)^3*((n-2)^2 - 2*(n-3)).A079503
a(n) = (n-1)^3*((n-2)^2 - 2*(n-3)).
- a(n) = 8*n^3*((2*n-1)^2 - 4*n + 4).A079504
a(n) = 8*n^3*((2*n-1)^2 - 4*n + 4).
- The last number for which a determinant of base-n numbers is nonzero.A079505
The last number for which a determinant of base-n numbers is nonzero.
- Numbers k with gcd(2^k-1, Fibonacci(k)) > 1 and not divisible by 2 or 11. Odd members of A074776 not divisible by 11.A079506
Numbers k with gcd(2^k-1, Fibonacci(k)) > 1 and not divisible by 2 or 11. Odd members of A074776 not divisible by 11.
- Triangle T(n,k) read by rows; related to number of preorders.A079507
Triangle T(n,k) read by rows; related to number of preorders.
- Triangle T(n,k) (n >= 2, k >= 1) of Raney numbers read by rows.A079508
Triangle T(n,k) (n >= 2, k >= 1) of Raney numbers read by rows.
- Duplicate of A000096.A079509
Duplicate of A000096.
- Triangle T(n,k) read by rows; related to number of preorders.A079510
Triangle T(n,k) read by rows; related to number of preorders.