Sequences
392,541 sequences
- The Alon-Tarsi constants AT(n).A065711
The Alon-Tarsi constants AT(n).
- Number of 1's in decimal expansion of 2^n.A065712
Number of 1's in decimal expansion of 2^n.
- Sum of digits of 4^n.A065713
Sum of digits of 4^n.
- Number of 3's in decimal expansion of 2^n.A065714
Number of 3's in decimal expansion of 2^n.
- Number of 4's in decimal expansion of 2^n.A065715
Number of 4's in decimal expansion of 2^n.
- Number of 5's in decimal expansion of 2^n.A065716
Number of 5's in decimal expansion of 2^n.
- Number of 6's in decimal expansion of 2^n.A065717
Number of 6's in decimal expansion of 2^n.
- Number of 7's in decimal expansion of 2^n.A065718
Number of 7's in decimal expansion of 2^n.
- Number of 8's in decimal expansion of 2^n.A065719
Number of 8's in decimal expansion of 2^n.
- Primes whose binary representation is also the decimal representation of a prime.A065720
Primes whose binary representation is also the decimal representation of a prime.
- Primes p whose base-3 expansion is also the decimal expansion of a prime.A065721
Primes p whose base-3 expansion is also the decimal expansion of a prime.
- Primes that when written in base 4, then reinterpreted in base 10, again give primes.A065722
Primes that when written in base 4, then reinterpreted in base 10, again give primes.
- Primes that when written in base 5, then reinterpreted in base 10, again give primes.A065723
Primes that when written in base 5, then reinterpreted in base 10, again give primes.
- Primes p such that the decimal expansion of its base-6 conversion is also prime.A065724
Primes p such that the decimal expansion of its base-6 conversion is also prime.
- Primes p such that the decimal expansion of its base-7 conversion is also prime.A065725
Primes p such that the decimal expansion of its base-7 conversion is also prime.
- Primes p whose base-8 expansion is also the decimal expansion of a prime.A065726
Primes p whose base-8 expansion is also the decimal expansion of a prime.
- Primes p such that the decimal expansion of its base-9 conversion is also prime.A065727
Primes p such that the decimal expansion of its base-9 conversion is also prime.
- Partition numbers (A000041) that are semiprimes (A001358).A065728
Partition numbers (A000041) that are semiprimes (A001358).
- Numbers k such that the k-th partition number (A000041(k)) is a semiprime.A065729
Numbers k such that the k-th partition number (A000041(k)) is a semiprime.
- Largest square <= n-th prime.A065730
Largest square <= n-th prime.
- Largest square <= n!.A065731
Largest square <= n!.
- Largest square <= 2^n.A065732
Largest square <= 2^n.
- Largest square <= n^3.A065733
Largest square <= n^3.
- Largest square <= sigma(n).A065734
Largest square <= sigma(n).
- Largest square <= product of first n primes.A065735
Largest square <= product of first n primes.
- Largest square <= 10^n.A065736
Largest square <= 10^n.
- Largest square <= binomial(n,2).A065737
Largest square <= binomial(n,2).
- Largest square <= binomial(2n,n).A065738
Largest square <= binomial(2n,n).
- Largest square <= sum of first n squares.A065739
Largest square <= sum of first n squares.
- Largest square <= n^n.A065740
Largest square <= n^n.
- Largest square <= sum of squares of divisors of n.A065741
Largest square <= sum of squares of divisors of n.
- Primes p(m) such that the set of quadratic residues modulo[p(m)] contains p(m-1).A065742
Primes p(m) such that the set of quadratic residues modulo[p(m)] contains p(m-1).
- Smallest number with exactly A025475(n) divisors.A065743
Smallest number with exactly A025475(n) divisors.
- Number of 9's in the decimal expansion of 2^n.A065744
Number of 9's in the decimal expansion of 2^n.
- Sum of squares and twice squares dividing n.A065745
Sum of squares and twice squares dividing n.
- Number of divisors of squares of all true powers of primes: a(n) = A000005(A025475(n+1)^2).A065746
Number of divisors of squares of all true powers of primes: a(n) = A000005(A025475(n+1)^2).
- Triangle of Gandhi polynomial coefficients.A065747
Triangle of Gandhi polynomial coefficients.
- Triangle of Gandhi polynomial coefficients.A065748
Triangle of Gandhi polynomial coefficients.
- Numbers k such that the pair (prime(k) - k)*(prime(k) + k) +- 1 is a twin prime.A065749
Numbers k such that the pair (prime(k) - k)*(prime(k) + k) +- 1 is a twin prime.
- Smaller term of a pair of twin primes of form (prime(i) - i)*(prime(i) + i) +- 1; the i is from A065749.A065750
Smaller term of a pair of twin primes of form (prime(i) - i)*(prime(i) + i) +- 1; the i is from A065749.
- Numbers whose decimal representations consist of nested and /or concatenated ordered pairs 0-9, 1-8, 2-7, 3-6 and 4-5.A065751
Numbers whose decimal representations consist of nested and /or concatenated ordered pairs 0-9, 1-8, 2-7, 3-6 and 4-5.
- Squares in A065751.A065752
Squares in A065751.
- Second column of A065747.A065753
Second column of A065747.
- Second column of A065748.A065754
Second column of A065748.
- Triangle of Gandhi polynomial coefficients.A065755
Triangle of Gandhi polynomial coefficients.
- Generalization of the Genocchi numbers given by the Gandhi polynomials A(n+1,r) = r^5 A(n, r + 1) - (r - 1)^5 A(n, r); A(1,r) = r^5 - (r-1)^5.A065756
Generalization of the Genocchi numbers given by the Gandhi polynomials A(n+1,r) = r^5 A(n, r + 1) - (r - 1)^5 A(n, r); A(1,r) = r^5 - (r-1)^5.
- Second column of A065755.A065757
Second column of A065755.
- Numbers m that minimize | k /(k- EulerPhi(k)) - golden ratio phi | when k runs over all the numbers with the same number of digits as m.A065758
Numbers m that minimize | k /(k- EulerPhi(k)) - golden ratio phi | when k runs over all the numbers with the same number of digits as m.
- For a number k of length L, let f(k) be the sum of the products of the first i digits of k multiplied by the last L-i digits, for i from 1 to L-1, e.g., f(1234) = 1*234 + 12*34 + 123*4 = 1134. Sequence gives k such that f(k) = k.A065759
For a number k of length L, let f(k) be the sum of the products of the first i digits of k multiplied by the last L-i digits, for i from 1 to L-1, e.g., f(1234) = 1*234 + 12*34 + 123*4 = 1134. Sequence gives k such that f(k) = k.
- Concatenation of increasing number of alternating digits in base 2, starting with 1.A065760
Concatenation of increasing number of alternating digits in base 2, starting with 1.