Sequences
392,541 sequences
- Size of the largest set encompassing no {x, 2x, 3x} contained in D(n) = the first n 3-smooth numbers {1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, ...} (A003586).A057561
Size of the largest set encompassing no {x, 2x, 3x} contained in D(n) = the first n 3-smooth numbers {1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, ...} (A003586).
- Number of partitions of n into parts all relatively prime to n.A057562
Number of partitions of n into parts all relatively prime to n.
- Numbers k such that the k initial decimal digits of e - 2 form a prime number.A057563
Numbers k such that the k initial decimal digits of e - 2 form a prime number.
- Natural numbers n for which the following three properties hold: (i) Phi[Sigma[n]]=2*phi(n), (ii) Sigma[n-2]=2*Sigma[Phi[n-2]], (iii) Sigma[n+2]=2*Sigma[Phi[n+2]].A057564
Natural numbers n for which the following three properties hold: (i) Phi[Sigma[n]]=2*phi(n), (ii) Sigma[n-2]=2*Sigma[Phi[n-2]], (iii) Sigma[n+2]=2*Sigma[Phi[n+2]].
- Number of regions of linearity for Lusztig's piecewise-linear function in type A_n.A057565
Number of regions of linearity for Lusztig's piecewise-linear function in type A_n.
- Number of collinear triples in a 3 X n rectangular grid.A057566
Number of collinear triples in a 3 X n rectangular grid.
- Number of partitions of n where the product of parts divides n.A057567
Number of partitions of n where the product of parts divides n.
- Number of partitions of n where n divides the product of the parts.A057568
Number of partitions of n where n divides the product of the parts.
- Numbers of the form k*(5*k+1)/2 or k*(5*k-1)/2.A057569
Numbers of the form k*(5*k+1)/2 or k*(5*k-1)/2.
- Numbers of the form n*(7n+-1)/2.A057570
Numbers of the form n*(7n+-1)/2.
- Area under Dyck paths.A057571
Area under Dyck paths.
- Number of unlabeled Hugenholtz diagrams with n nodes.A057572
Number of unlabeled Hugenholtz diagrams with n nodes.
- Number of primes in A051351 which have index <= 10^n.A057573
Number of primes in A051351 which have index <= 10^n.
- Maximal numbers of codewords in mixed code with n binary coordinates and 1 ternary coordinate with Hamming distance 3.A057574
Maximal numbers of codewords in mixed code with n binary coordinates and 1 ternary coordinate with Hamming distance 3.
- Maximal numbers of codewords in mixed code with n binary coordinates and 2 ternary coordinates with Hamming distance 3.A057575
Maximal numbers of codewords in mixed code with n binary coordinates and 2 ternary coordinates with Hamming distance 3.
- Maximal numbers of codewords in mixed code with n binary coordinates and 3 ternary coordinates with Hamming distance 3.A057576
Maximal numbers of codewords in mixed code with n binary coordinates and 3 ternary coordinates with Hamming distance 3.
- Maximal numbers of codewords in mixed code with n binary coordinates and 4 ternary coordinates with Hamming distance 3.A057577
Maximal numbers of codewords in mixed code with n binary coordinates and 4 ternary coordinates with Hamming distance 3.
- Maximal numbers of codewords in ternary code of length n with Hamming distance 3.A057578
Maximal numbers of codewords in ternary code of length n with Hamming distance 3.
- Maximal numbers of codewords in mixed code with 1 binary coordinate and n ternary coordinates with Hamming distance 3.A057579
Maximal numbers of codewords in mixed code with 1 binary coordinate and n ternary coordinates with Hamming distance 3.
- Maximal numbers of codewords in mixed code with 2 binary coordinates and n ternary coordinates with Hamming distance 3.A057580
Maximal numbers of codewords in mixed code with 2 binary coordinates and n ternary coordinates with Hamming distance 3.
- Maximal numbers of codewords in mixed code with 3 binary coordinates and n ternary coordinates with Hamming distance 3.A057581
Maximal numbers of codewords in mixed code with 3 binary coordinates and n ternary coordinates with Hamming distance 3.
- Maximal numbers of codewords in mixed code with 4 binary coordinates and n ternary coordinates with Hamming distance 3.A057582
Maximal numbers of codewords in mixed code with 4 binary coordinates and n ternary coordinates with Hamming distance 3.
- Maximal numbers of codewords in mixed code with 5 binary coordinates and n ternary coordinates with Hamming distance 3.A057583
Maximal numbers of codewords in mixed code with 5 binary coordinates and n ternary coordinates with Hamming distance 3.
- Maximal numbers of codewords in mixed code with 6 binary coordinates and n ternary coordinates with Hamming distance 3.A057584
Maximal numbers of codewords in mixed code with 6 binary coordinates and n ternary coordinates with Hamming distance 3.
- Area under Motzkin excursions.A057585
Area under Motzkin excursions.
- Area under Motzkin paths.A057586
Area under Motzkin paths.
- Nonnegative numbers of form n*(n^2+-1)/2.A057587
Nonnegative numbers of form n*(n^2+-1)/2.
- Kummer numbers: -1 + product of first n consecutive primes.A057588
Kummer numbers: -1 + product of first n consecutive primes.
- Numbers n which are both lucky (A000959) and Fibonacci (A000045).A057589
Numbers n which are both lucky (A000959) and Fibonacci (A000045).
- Numbers of the form k*(k^3 +- 1)/2.A057590
Numbers of the form k*(k^3 +- 1)/2.
- Maximal size of binary code of length n that corrects 2 deletions.A057591
Maximal size of binary code of length n that corrects 2 deletions.
- a(n) = Fibonacci(n+1)^2 + 4*Fibonacci(n).A057592
a(n) = Fibonacci(n+1)^2 + 4*Fibonacci(n).
- Triangle T(n, k) giving period length of the periodic sequence k^i (i >= imin) mod n (n >= 2, 1 <= k <= n-1).A057593
Triangle T(n, k) giving period length of the periodic sequence k^i (i >= imin) mod n (n >= 2, 1 <= k <= n-1).
- Triangle T(n,k) giving floor( (2*p mod n-1)/2), where p = period of sequence k^i (i=0,1,2,...) mod n (n >= 2, 2<=k<=n).A057594
Triangle T(n,k) giving floor( (2*p mod n-1)/2), where p = period of sequence k^i (i=0,1,2,...) mod n (n >= 2, 2<=k<=n).
- Triangle T(n,k) giving 2*p mod n-1, where p = period of sequence k^i (i=0,1,2,...) mod n (n >= 2, 2<=k<=n).A057595
Triangle T(n,k) giving 2*p mod n-1, where p = period of sequence k^i (i=0,1,2,...) mod n (n >= 2, 2<=k<=n).
- E.g.f. is 1/E(x) where E(x) is e.g.f. for [1,0,1,1,2,3,5,8,...] with o.g.f. (1-x)/(1-x-x^2).A057596
E.g.f. is 1/E(x) where E(x) is e.g.f. for [1,0,1,1,2,3,5,8,...] with o.g.f. (1-x)/(1-x-x^2).
- a(n) = -a(n-1) - a(n-2) + a(n-3), a(0)=0, a(1)=0, a(2)=1.A057597
a(n) = -a(n-1) - a(n-2) + a(n-3), a(0)=0, a(1)=0, a(2)=1.
- Erroneous version of A007535.A057598
Erroneous version of A007535.
- a(n) = (n^2)!/(n!)^(n+1); number of ways of dividing n^2 labeled items into n unlabeled boxes of n items each.A057599
a(n) = (n^2)!/(n!)^(n+1); number of ways of dividing n^2 labeled items into n unlabeled boxes of n items each.
- a(n) is smallest number m such that (m = product of n distinct primes) and all divisors of m are lucky numbers.A057600
a(n) is smallest number m such that (m = product of n distinct primes) and all divisors of m are lucky numbers.
- a(0) = a(1) = 1; a(n+1) is the number of partitions of n into parts a(k), 0 <= k <= n, each k occurring at most once.A057601
a(0) = a(1) = 1; a(n+1) is the number of partitions of n into parts a(k), 0 <= k <= n, each k occurring at most once.
- a(1)=2, a(n+1) is the smallest integer > a(n) such that the smallest prime factor of a(n+1) is the largest prime factor of a(n).A057602
a(1)=2, a(n+1) is the smallest integer > a(n) such that the smallest prime factor of a(n+1) is the largest prime factor of a(n).
- Second term of continued fraction for log(n).A057603
Second term of continued fraction for log(n).
- Primes of the form 4*k^2 + 163.A057604
Primes of the form 4*k^2 + 163.
- Nonnegative n such that 4*n^2 + 163 is prime.A057605
Nonnegative n such that 4*n^2 + 163 is prime.
- Triangle read by rows: T(n,k) = number of binary n-tuples u having exactly k grandchildren, where a grandchild is a vector obtained by deleting any two coordinates of u (n >= 3, 1<=k<=2^(n-2)).A057606
Triangle read by rows: T(n,k) = number of binary n-tuples u having exactly k grandchildren, where a grandchild is a vector obtained by deleting any two coordinates of u (n >= 3, 1<=k<=2^(n-2)).
- Triangle T(n,k) = number of binary n-tuples u having exactly k grandchildren, where a grandchild is a vector obtained by deleting any two coordinates of u (n >= 2, 0<=k<=2^(n-2)).A057607
Triangle T(n,k) = number of binary n-tuples u having exactly k grandchildren, where a grandchild is a vector obtained by deleting any two coordinates of u (n >= 2, 0<=k<=2^(n-2)).
- Maximal size of binary code of length n that corrects one transposition (end-around transposition not included).A057608
Maximal size of binary code of length n that corrects one transposition (end-around transposition not included).
- Powers of a prime lucky number (A031157) but excluding lucky numbers (A000959).A057609
Powers of a prime lucky number (A031157) but excluding lucky numbers (A000959).
- Smallest lucky number with a decimal expansion starting n, n-1, ..., 2, 1.A057610
Smallest lucky number with a decimal expansion starting n, n-1, ..., 2, 1.