Sequences
392,541 sequences
- Triangle of Sulanke numbers: T(n,k) = T(n,k-1) + a(n-1,k) for n+k even and a(n,k) = a(n,k-1) + 2*a(n-1,k) for n+k odd.A064861
Triangle of Sulanke numbers: T(n,k) = T(n,k-1) + a(n-1,k) for n+k even and a(n,k) = a(n,k-1) + 2*a(n-1,k) for n+k odd.
- Period of continued fraction for sqrt(10)*n.A064862
Period of continued fraction for sqrt(10)*n.
- Period of continued fraction for sqrt(11)*n.A064863
Period of continued fraction for sqrt(11)*n.
- Period of continued fraction for sqrt(13)*n.A064864
Period of continued fraction for sqrt(13)*n.
- Fill a triangular array by rows by writing numbers 1, then 1 up to 2^2, then 1 up to 3^2, then 1 up to 4^2 and so on. The final elements of the rows form the sequence.A064865
Fill a triangular array by rows by writing numbers 1, then 1 up to 2^2, then 1 up to 3^2, then 1 up to 4^2 and so on. The final elements of the rows form the sequence.
- Write numbers 1, then 1 up to 2^2, then 1 up to 3^2, then 1 up to 4^2 and so on.A064866
Write numbers 1, then 1 up to 2^2, then 1 up to 3^2, then 1 up to 4^2 and so on.
- The minimal number which has multiplicative persistence 3 in base n.A064867
The minimal number which has multiplicative persistence 3 in base n.
- The minimal number which has multiplicative persistence 4 in base n.A064868
The minimal number which has multiplicative persistence 4 in base n.
- The minimal number which has multiplicative persistence 5 in base n.A064869
The minimal number which has multiplicative persistence 5 in base n.
- The minimal number which has multiplicative persistence 6 in base n.A064870
The minimal number which has multiplicative persistence 6 in base n.
- The minimal number which has multiplicative persistence 7 in base n.A064871
The minimal number which has multiplicative persistence 7 in base n.
- The minimal number which has multiplicative persistence 8 in base n.A064872
The minimal number which has multiplicative persistence 8 in base n.
- First of four sequences representing the lexicographical minimal decomposition of n in 4 squares: n = a(n)^2 + A064874(n)^2 + A064875(n)^2 + A064876(n)^2.A064873
First of four sequences representing the lexicographical minimal decomposition of n in 4 squares: n = a(n)^2 + A064874(n)^2 + A064875(n)^2 + A064876(n)^2.
- Second of four sequences representing the lexicographical minimal decomposition of n in 4 squares: n = A064873(n)^2 + a(n)^2 + A064875(n)^2 + A064876(n)^2.A064874
Second of four sequences representing the lexicographical minimal decomposition of n in 4 squares: n = A064873(n)^2 + a(n)^2 + A064875(n)^2 + A064876(n)^2.
- Third of four sequences representing the lexicographical minimal decomposition of n in four squares: n = A064873(n)^2 + A064874(n)^2 + a(n)^2 + A064876(n)^2.A064875
Third of four sequences representing the lexicographical minimal decomposition of n in four squares: n = A064873(n)^2 + A064874(n)^2 + a(n)^2 + A064876(n)^2.
- Last of four sequences representing the lexicographical minimal decomposition of n in 4 squares: n = A064873(n)^2 + A064874(n)^2 + A064875(n)^2 + a(n)^2.A064876
Last of four sequences representing the lexicographical minimal decomposition of n in 4 squares: n = A064873(n)^2 + A064874(n)^2 + A064875(n)^2 + a(n)^2.
- a(n) = n - (A064873(n) + A064874(n) + A064875(n) + A064876(n)).A064877
a(n) = n - (A064873(n) + A064874(n) + A064875(n) + A064876(n)).
- Generalized Catalan numbers C(10,10; n).A064878
Generalized Catalan numbers C(10,10; n).
- Triangle of numbers composed of certain generalized Catalan numbers.A064879
Triangle of numbers composed of certain generalized Catalan numbers.
- Row sums of triangle A064879.A064880
Row sums of triangle A064879.
- Eisenstein array Ei(1,2).A064881
Eisenstein array Ei(1,2).
- Eisenstein array Ei(2,1).A064882
Eisenstein array Ei(2,1).
- Eisenstein array Ei(1,3).A064883
Eisenstein array Ei(1,3).
- Eisenstein array Ei(3,1).A064884
Eisenstein array Ei(3,1).
- Eisenstein array Ei(3,2).A064885
Eisenstein array Ei(3,2).
- Eisenstein array Ei(2,3).A064886
Eisenstein array Ei(2,3).
- Period of continued fraction for sqrt(14)*n.A064887
Period of continued fraction for sqrt(14)*n.
- Numerators of partial sums of 1/A051451.A064888
Numerators of partial sums of 1/A051451.
- Denominators of partial sums of reciprocals of A051451 (A051451 includes lcm(1,...,x), x=power of prime from A000961 and also contains 1).A064889
Denominators of partial sums of reciprocals of A051451 (A051451 includes lcm(1,...,x), x=power of prime from A000961 and also contains 1).
- Decimal expansion of the sum of reciprocals of A051451, which includes 1 and values of lcm(1,...,x), where x is a prime power (A000961).A064890
Decimal expansion of the sum of reciprocals of A051451, which includes 1 and values of lcm(1,...,x), where x is a prime power (A000961).
- "Binary potency" of n: length of shortest blocks of 0's inserted between the bits of n required to "dilute" it into a nonprime.A064891
"Binary potency" of n: length of shortest blocks of 0's inserted between the bits of n required to "dilute" it into a nonprime.
- "Binary potency" of n-th prime p: length of shortest blocks of 0's inserted between the bits of p required to "dilute" it into a nonprime.A064892
"Binary potency" of n-th prime p: length of shortest blocks of 0's inserted between the bits of p required to "dilute" it into a nonprime.
- Smallest number with "binary potency" of n. Blocks of at least n 0's must be inserted between the bits of a(n) to "dilute" it into a nonprime.A064893
Smallest number with "binary potency" of n. Blocks of at least n 0's must be inserted between the bits of a(n) to "dilute" it into a nonprime.
- Binary dilution of n. GCD of exponents in binary expansion of n.A064894
Binary dilution of n. GCD of exponents in binary expansion of n.
- Binary concentration of n. Replace 2^e_k with 2^(e_k/g(n)) in binary expansion of n, where g(n) = GCD of exponents e_k = A064894(n).A064895
Binary concentration of n. Replace 2^e_k with 2^(e_k/g(n)) in binary expansion of n, where g(n) = GCD of exponents e_k = A064894(n).
- Numbers of the form (2^(m*r)-1)/(2^r-1) for positive integers m, r.A064896
Numbers of the form (2^(m*r)-1)/(2^r-1) for positive integers m, r.
- Period of continued fraction for sqrt(15)*n.A064897
Period of continued fraction for sqrt(15)*n.
- Stirling transform of derangements numbers.A064898
Stirling transform of derangements numbers.
- Numbers that are of the form pq where p and q are distinct primes that are the orders of non-Abelian groups.A064899
Numbers that are of the form pq where p and q are distinct primes that are the orders of non-Abelian groups.
- Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 2.A064900
Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 2.
- Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 3.A064901
Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 3.
- Semiprimes p1*p2 such that p2 mod p1 = 4, with p2 > p1.A064902
Semiprimes p1*p2 such that p2 mod p1 = 4, with p2 > p1.
- Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 5.A064903
Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 5.
- Semiprimes p1*p2 such that p2 mod p1 = 6, with p2 > p1.A064904
Semiprimes p1*p2 such that p2 mod p1 = 6, with p2 > p1.
- Semiprimes p1*p2 such that p2>p1 and p2 mod p1 = 7.A064905
Semiprimes p1*p2 such that p2>p1 and p2 mod p1 = 7.
- Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 8.A064906
Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 8.
- Semiprimes p1*p2 such that p2 mod p1 = 9, with p2 > p1.A064907
Semiprimes p1*p2 such that p2 mod p1 = 9, with p2 > p1.
- Semiprimes p1*p2 such that p2 mod p1 = 10, with p2 > p1.A064908
Semiprimes p1*p2 such that p2 mod p1 = 10, with p2 > p1.
- Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 11.A064909
Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 11.
- Smallest semiprime p*q such that q >= p and q mod p = n.A064910
Smallest semiprime p*q such that q >= p and q mod p = n.