Sequences
392,541 sequences
- Covering numbers C(n,8,7).A066011
Covering numbers C(n,8,7).
- Highest minimal Lee distance of any Type 4^Z self-dual code of length n over Z/4Z which does not have all Euclidean norms divisible by 8, that is, is strictly Type I. Compare A105681.A066012
Highest minimal Lee distance of any Type 4^Z self-dual code of length n over Z/4Z which does not have all Euclidean norms divisible by 8, that is, is strictly Type I. Compare A105681.
- Number of codes having highest minimal Lee distance of any Type 4^Z self-dual code of length n over Z/4Z which does not have all Euclidean norms divisible by 8, that is, is strictly Type I. Compare A105688.A066013
Number of codes having highest minimal Lee distance of any Type 4^Z self-dual code of length n over Z/4Z which does not have all Euclidean norms divisible by 8, that is, is strictly Type I. Compare A105688.
- Highest minimal Euclidean norm of any Type 4^Z self-dual code of length n over Z/4Z which does not have all Euclidean norms divisible by 8, that is, is strictly Type I. Compare A105682.A066014
Highest minimal Euclidean norm of any Type 4^Z self-dual code of length n over Z/4Z which does not have all Euclidean norms divisible by 8, that is, is strictly Type I. Compare A105682.
- Number of codes having highest minimal Euclidean norm of any Type 4^Z self-dual code of length n over Z/4Z which does not have all Euclidean norms divisible by 8, that is, is strictly Type I. Compare A105682.A066015
Number of codes having highest minimal Euclidean norm of any Type 4^Z self-dual code of length n over Z/4Z which does not have all Euclidean norms divisible by 8, that is, is strictly Type I. Compare A105682.
- Highest minimal Hamming distance of any Type 4^Z self-dual code of length n over Z/4Z.A066016
Highest minimal Hamming distance of any Type 4^Z self-dual code of length n over Z/4Z.
- Number of inequivalent codes attaining highest minimal Hamming distance of any Type 4^Z self-dual code of length n over Z/4Z.A066017
Number of inequivalent codes attaining highest minimal Hamming distance of any Type 4^Z self-dual code of length n over Z/4Z.
- a(n) is the smallest k such that (k^4 + 1)/(n^4 + 1) is an integer > 1.A066018
a(n) is the smallest k such that (k^4 + 1)/(n^4 + 1) is an integer > 1.
- Triangle of covering numbers T(n,k) = C(n,k,k-2), n >= 3, 3 <= k <= n.A066019
Triangle of covering numbers T(n,k) = C(n,k,k-2), n >= 3, 3 <= k <= n.
- a(n) is the smallest k such that (k^5 + 1)/(n^5 + 1) is an integer > 1.A066020
a(n) is the smallest k such that (k^5 + 1)/(n^5 + 1) is an integer > 1.
- (a(n)^6+1)/(n^6+1) is the smallest integer > 1.A066021
(a(n)^6+1)/(n^6+1) is the smallest integer > 1.
- Number of digits in n^n.A066022
Number of digits in n^n.
- (a(n)^7+1)/(n^7+1) is the smallest integer > 1.A066023
(a(n)^7+1)/(n^7+1) is the smallest integer > 1.
- Numbers k such that the product of the digits of k minus the sum of the digits of k is prime.A066024
Numbers k such that the product of the digits of k minus the sum of the digits of k is prime.
- Numbers k such that gcd(sigma(k), sigma(k+1)) > k.A066025
Numbers k such that gcd(sigma(k), sigma(k+1)) > k.
- a(n) = ceiling(log(n!)).A066026
a(n) = ceiling(log(n!)).
- Numbers k such that the sum of digits of k minus the product of digits of k is prime.A066027
Numbers k such that the sum of digits of k minus the product of digits of k is prime.
- Largest prime which can be written as a sum of distinct primes <= prime(n).A066028
Largest prime which can be written as a sum of distinct primes <= prime(n).
- Incorrect version of A036459.A066029
Incorrect version of A036459.
- Card{i<=n, floor(n/i)=0 mod(i)}.A066030
Card{i<=n, floor(n/i)=0 mod(i)}.
- Composite numbers n the sum of whose prime factors divides n, but which are not themselves powers of primes.A066031
Composite numbers n the sum of whose prime factors divides n, but which are not themselves powers of primes.
- Number of ways to write n as a product with no factor larger than m (1 <= m <=n, written row by row).A066032
Number of ways to write n as a product with no factor larger than m (1 <= m <=n, written row by row).
- Alternating sum of primes: a(1) = A000040(1) = 2 and a(n) = a(n-1) + A000040(n)*(-1)^n for n > 1.A066033
Alternating sum of primes: a(1) = A000040(1) = 2 and a(n) = a(n-1) + A000040(n)*(-1)^n for n > 1.
- Second term in the continued fraction expansion of StieltjesGamma[n].A066034
Second term in the continued fraction expansion of StieltjesGamma[n].
- First term in the continued fraction expansion of StieltjesGamma[n].A066035
First term in the continued fraction expansion of StieltjesGamma[n].
- Continued fraction expansion of StieltjesGamma[1].A066036
Continued fraction expansion of StieltjesGamma[1].
- Number of (undirected) Hamiltonian cycles in the binary n-cube, or the number of cyclic n-bit Gray codes.A066037
Number of (undirected) Hamiltonian cycles in the binary n-cube, or the number of cyclic n-bit Gray codes.
- Numbers with at least two prime factors such that the sum of the prime factors is prime.A066038
Numbers with at least two prime factors such that the sum of the prime factors is prime.
- Largest prime less than or equal to the sum of first n primes (A007504).A066039
Largest prime less than or equal to the sum of first n primes (A007504).
- Triangle of covering numbers T(n,k) = C(n,k,k-3), n >= 4, 4 <= k <= n.A066040
Triangle of covering numbers T(n,k) = C(n,k,k-3), n >= 4, 4 <= k <= n.
- Triangle of covering numbers T(n,k) = C(n,k,k-4), n >= 5, 5 <= k <= n.A066041
Triangle of covering numbers T(n,k) = C(n,k,k-4), n >= 5, 5 <= k <= n.
- Numbers k such that k divided by ((sum of digits of k) multiplied by (product of digits of k)) is prime.A066042
Numbers k such that k divided by ((sum of digits of k) multiplied by (product of digits of k)) is prime.
- a(1) = 1; for m > 0, a(2m) = 2m, a(2m+1) = 4m+2.A066043
a(1) = 1; for m > 0, a(2m) = 2m, a(2m+1) = 4m+2.
- Numbers k that are repdigits in more bases (smaller than k) than any smaller number.A066044
Numbers k that are repdigits in more bases (smaller than k) than any smaller number.
- Triangle T(n,k) defined by Sum_{1<=k<=n} T(n,k)*u^k*t^n/n! = exp(((1-t)*(1-t^2)*(1-t^3)...)^(-u)-1).A066045
Triangle T(n,k) defined by Sum_{1<=k<=n} T(n,k)*u^k*t^n/n! = exp(((1-t)*(1-t^2)*(1-t^3)...)^(-u)-1).
- a(1) = 1; a(2) = 2; a(3) = 3; a(n+3) = a(n+2)*a(n+1) + a(n+1)*a(n) + a(n)*a(n+2).A066046
a(1) = 1; a(2) = 2; a(3) = 3; a(n+3) = a(n+2)*a(n+1) + a(n+1)*a(n) + a(n)*a(n+2).
- Numbers k that divide A001045(k-1).A066047
Numbers k that divide A001045(k-1).
- Product of smallest and greatest prime factors of n.A066048
Product of smallest and greatest prime factors of n.
- Numbers n such that 2*n^2 - 1 is a prime.A066049
Numbers n such that 2*n^2 - 1 is a prime.
- Average of divisors of n (sigma(n)/d(n)) is greater than average of divisors for all k < n.A066050
Average of divisors of n (sigma(n)/d(n)) is greater than average of divisors for all k < n.
- Maximal degree of an irreducible representation of the group of n X n signed permutation matrices.A066051
Maximal degree of an irreducible representation of the group of n X n signed permutation matrices.
- Number of permutations in the symmetric group S_n with order >= 3.A066052
Number of permutations in the symmetric group S_n with order >= 3.
- Stirling transform of A002457.A066053
Stirling transform of A002457.
- 'Reverse and Add!' trajectory of 10583.A066054
'Reverse and Add!' trajectory of 10583.
- Integers n > 10583 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 10583.A066055
Integers n > 10583 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 10583.
- Number of 'Reverse and Add!' operations that have to be applied to the n-th term of A066055 in order to obtain a term in the trajectory of 10583.A066056
Number of 'Reverse and Add!' operations that have to be applied to the n-th term of A066055 in order to obtain a term in the trajectory of 10583.
- 'Reverse and Add' carried out in base 2 (cf. A062128); number of steps needed to reach a palindrome, or -1 if no palindrome is ever reached.A066057
'Reverse and Add' carried out in base 2 (cf. A062128); number of steps needed to reach a palindrome, or -1 if no palindrome is ever reached.
- In base 2: smallest integer which requires n 'Reverse and Add' steps to reach a palindrome.A066058
In base 2: smallest integer which requires n 'Reverse and Add' steps to reach a palindrome.
- Integers such that the 'Reverse and Add!' algorithm in base 2 (cf. A062128) does not lead to a palindrome.A066059
Integers such that the 'Reverse and Add!' algorithm in base 2 (cf. A062128) does not lead to a palindrome.
- Number of nilpotent groups of order n.A066060
Number of nilpotent groups of order n.