Sequences
392,541 sequences
- Numbers (with nonzero digits only) where A046810 increases.A046811
Numbers (with nonzero digits only) where A046810 increases.
- Number of prime anagrams of A046811(n).A046812
Number of prime anagrams of A046811(n).
- Smallest number m with nonzero digits such that A046810(m)=n.A046813
Smallest number m with nonzero digits such that A046810(m)=n.
- Row sums of triangle A046527.A046814
Row sums of triangle A046527.
- Smallest number which can be written as the sum of distinct Fibonacci numbers in n ways and such that the Zeckendorf representation of the number uses only even-subscripted Fibonacci numbers.A046815
Smallest number which can be written as the sum of distinct Fibonacci numbers in n ways and such that the Zeckendorf representation of the number uses only even-subscripted Fibonacci numbers.
- Pascal's tetrahedron: entries in 3-dimensional version of Pascal triangle, or trinomial coefficients.A046816
Pascal's tetrahedron: entries in 3-dimensional version of Pascal triangle, or trinomial coefficients.
- Triangle of generalized Stirling numbers of 2nd kind.A046817
Triangle of generalized Stirling numbers of 2nd kind.
- Number of 1's in binary expansion of 3n+1.A046818
Number of 1's in binary expansion of 3n+1.
- Number of 1's in binary expansion of 3n+2.A046819
Number of 1's in binary expansion of 3n+2.
- Number of 1's in binary expansion of 5n.A046820
Number of 1's in binary expansion of 5n.
- Number of 1's in binary expansion of 5n+1.A046821
Number of 1's in binary expansion of 5n+1.
- Number of 1's in binary expansion of 5n+2.A046822
Number of 1's in binary expansion of 5n+2.
- Number of 1's in binary expansion of 5n+3.A046823
Number of 1's in binary expansion of 5n+3.
- Number of 1's in binary expansion of 5n+4.A046824
Number of 1's in binary expansion of 5n+4.
- Numerator of Sum_{k=0..n} 1/binomial(n,k).A046825
Numerator of Sum_{k=0..n} 1/binomial(n,k).
- Denominator of Sum_{k=0..n} 1/binomial(n,k).A046826
Denominator of Sum_{k=0..n} 1/binomial(n,k).
- Numbers k such that k^2 contains all the digits of k with the same or higher multiplicity.A046827
Numbers k such that k^2 contains all the digits of k with the same or higher multiplicity.
- Digits of n^2 include digits of n, n does not end in 0.A046828
Digits of n^2 include digits of n, n does not end in 0.
- Numbers k such that digits of k^2 include digits of k as subsequence.A046829
Numbers k such that digits of k^2 include digits of k as subsequence.
- Digits of n^2 include digits of n as subsequence, n does not end in 0.A046830
Digits of n^2 include digits of n as subsequence, n does not end in 0.
- Numbers k such that decimal expansion of k^2 contains k as a substring and k does not end in 0.A046831
Numbers k such that decimal expansion of k^2 contains k as a substring and k does not end in 0.
- Internal digits of n^2 include digits of n.A046832
Internal digits of n^2 include digits of n.
- Internal digits of n^2 include digits of n, n does not end in 0.A046833
Internal digits of n^2 include digits of n, n does not end in 0.
- Internal digits of n^2 include digits of n as subsequence.A046834
Internal digits of n^2 include digits of n as subsequence.
- Internal digits of n^2 include digits of n as subsequence, n does not end in 0.A046835
Internal digits of n^2 include digits of n as subsequence, n does not end in 0.
- Internal digits of n^2 include digits of n as substring.A046836
Internal digits of n^2 include digits of n as substring.
- Internal digits of k^2 include digits of k as substring, k does not end in 0.A046837
Internal digits of k^2 include digits of k as substring, k does not end in 0.
- Numbers k such that k^2 can be obtained from k by inserting a block of digits.A046838
Numbers k such that k^2 can be obtained from k by inserting a block of digits.
- Numbers k such that the number of divisors of k divides the sum of cubes of divisors of k.A046839
Numbers k such that the number of divisors of k divides the sum of cubes of divisors of k.
- Numbers k such that the number of divisors of k divides the sum of the 4th powers of the divisors of k.A046840
Numbers k such that the number of divisors of k divides the sum of the 4th powers of the divisors of k.
- Numbers whose sum of divisors divides their sum of cubes of divisors.A046841
Numbers whose sum of divisors divides their sum of cubes of divisors.
- Primes of form k*2^k - k - 1.A046842
Primes of form k*2^k - k - 1.
- Numbers k such that k*2^k - k - 1 is prime.A046843
Numbers k such that k*2^k - k - 1 is prime.
- Primes of the form k*2^k+(k+1).A046844
Primes of the form k*2^k+(k+1).
- Numbers k such that k*2^k + (k+1) is prime.A046845
Numbers k such that k*2^k + (k+1) is prime.
- Primes of form k*2^k - (k-1).A046846
Primes of form k*2^k - (k-1).
- Numbers k such that k*2^k - (k-1) is prime.A046847
Numbers k such that k*2^k - (k-1) is prime.
- Primes of form k*2^k+(k-1).A046848
Primes of form k*2^k+(k-1).
- Numbers k such that k*2^k+(k-1) is prime.A046849
Numbers k such that k*2^k+(k-1) is prime.
- Gilda's primes: primes in A042947.A046850
Gilda's primes: primes in A042947.
- Numbers n such that n^2 can be obtained from n by inserting internal (but not necessarily contiguous) digits.A046851
Numbers n such that n^2 can be obtained from n by inserting internal (but not necessarily contiguous) digits.
- Numerator of sum of reciprocals of first n palindromic primes.A046852
Numerator of sum of reciprocals of first n palindromic primes.
- Denominator of sum of reciprocals of first n palindromic primes.A046853
Denominator of sum of reciprocals of first n palindromic primes.
- Triangle read by rows: T(n, k) = binomial(floor((n+k)/2), k), n >= k >= 0.A046854
Triangle read by rows: T(n, k) = binomial(floor((n+k)/2), k), n >= k >= 0.
- a(n) = Sum_{i=0..n} binomial(2^n-1, i).A046855
a(n) = Sum_{i=0..n} binomial(2^n-1, i).
- a(n) = (2^n)!/4^n, with a(1)=1, a(2)=2.A046856
a(n) = (2^n)!/4^n, with a(1)=1, a(2)=2.
- a(n) = (2^n)!/(n!^2).A046857
a(n) = (2^n)!/(n!^2).
- Irregular triangle read by rows: T(n,k) = number of directed graphs-with-loops with n nodes and k arcs (n >= 0, 0 <= k <= n^2).A046858
Irregular triangle read by rows: T(n,k) = number of directed graphs-with-loops with n nodes and k arcs (n >= 0, 0 <= k <= n^2).
- Simplified Ackermann function (main diagonal of Ackermann-Péter function).A046859
Simplified Ackermann function (main diagonal of Ackermann-Péter function).
- Triangle giving a(n,k) = number of k-colored labeled graphs with n nodes.A046860
Triangle giving a(n,k) = number of k-colored labeled graphs with n nodes.