Sequences
392,541 sequences
- floor[2^n/Fibonacci(n)].A057861
floor[2^n/Fibonacci(n)].
- a(n) = 2^n mod Fibonacci(n).A057862
a(n) = 2^n mod Fibonacci(n).
- a(n) = Product_{k=1..n} (2k-1)!!.A057863
a(n) = Product_{k=1..n} (2k-1)!!.
- Number of simple traceable graphs on n nodes.A057864
Number of simple traceable graphs on n nodes.
- Number of simple Hamilton-connected graphs on n nodes.A057865
Number of simple Hamilton-connected graphs on n nodes.
- Sum_{k>=1} 1/(tanh(k*Pi) * k^(4n-1)) = Pi^(4n-1)*A057866(n)/A057867(n).A057866
Sum_{k>=1} 1/(tanh(k*Pi) * k^(4n-1)) = Pi^(4n-1)*A057866(n)/A057867(n).
- Denominator of coefficient of Pi^n in Ramanujan-like series for Zeta[4n+3].A057867
Denominator of coefficient of Pi^n in Ramanujan-like series for Zeta[4n+3].
- Denominator of "modified Bernoulli number" b(2n) = Bernoulli(2*n)/(4*n*(2*n)!).A057868
Denominator of "modified Bernoulli number" b(2n) = Bernoulli(2*n)/(4*n*(2*n)!).
- Triangle of coefficients of x^2 in the Neumann polynomials.A057869
Triangle of coefficients of x^2 in the Neumann polynomials.
- Number of singular points on n-th order Chmutov surface.A057870
Number of singular points on n-th order Chmutov surface.
- Numbers k such that 3*13^k + 2 is prime.A057871
Numbers k such that 3*13^k + 2 is prime.
- A version of the Chebyshev function theta(n): a(n) = round(Sum_{primes p <= n } log(p)).A057872
A version of the Chebyshev function theta(n): a(n) = round(Sum_{primes p <= n } log(p)).
- a(1) = 1; a(n+1) = sum of terms in continued fraction for sum{k=1 to n}[a(n+1-k)/a(k)].A057873
a(1) = 1; a(n+1) = sum of terms in continued fraction for sum{k=1 to n}[a(n+1-k)/a(k)].
- Sets of three composites in bidirectional 'sum of prime factors' progression/retrogression.A057874
Sets of three composites in bidirectional 'sum of prime factors' progression/retrogression.
- Numbers of 2n-digit primes which are concatenations of n-digit primes (no leading zeros allowed).A057875
Numbers of 2n-digit primes which are concatenations of n-digit primes (no leading zeros allowed).
- Primes p with the following property: let d_1, d_2, ... be the distinct digits occurring in the decimal expansion of p. Then for each d_i, dropping all the digits d_i from p produces a prime number. Leading 0's are not allowed.A057876
Primes p with the following property: let d_1, d_2, ... be the distinct digits occurring in the decimal expansion of p. Then for each d_i, dropping all the digits d_i from p produces a prime number. Leading 0's are not allowed.
- a(n) = smallest n-digit prime in A057876.A057877
a(n) = smallest n-digit prime in A057876.
- Primes with 2 distinct digits that remain prime (no leading zeros allowed) after deleting all occurrences of its digits d.A057878
Primes with 2 distinct digits that remain prime (no leading zeros allowed) after deleting all occurrences of its digits d.
- Primes with 3 distinct digits that remain prime (no leading zeros allowed) after deleting all occurrences of any one of its distinct digits.A057879
Primes with 3 distinct digits that remain prime (no leading zeros allowed) after deleting all occurrences of any one of its distinct digits.
- Primes with 4 distinct digits that remain prime (no leading zeros allowed) after deleting all occurrences of its digits d.A057880
Primes with 4 distinct digits that remain prime (no leading zeros allowed) after deleting all occurrences of its digits d.
- Primes with 5 distinct digits that remain prime (no leading zeros allowed) after deleting all occurrences of its digits d.A057881
Primes with 5 distinct digits that remain prime (no leading zeros allowed) after deleting all occurrences of its digits d.
- Primes with 6 distinct digits that remain prime (no leading zeros allowed) after deleting all occurrences of its digits d.A057882
Primes with 6 distinct digits that remain prime (no leading zeros allowed) after deleting all occurrences of its digits d.
- Smallest possible prime with at least n (from 2 to 10) distinct digits that remains prime (leading zeros not allowed) when all occurrences of its digits d are deleted.A057883
Smallest possible prime with at least n (from 2 to 10) distinct digits that remains prime (leading zeros not allowed) when all occurrences of its digits d are deleted.
- A square array based on tetrahedral numbers (A000292) with each term being the sum of 2 consecutive terms in the previous row.A057884
A square array based on tetrahedral numbers (A000292) with each term being the sum of 2 consecutive terms in the previous row.
- Numbers n such that digits of n and the prime factorization of n are distinct and nonrepeating.A057885
Numbers n such that digits of n and the prime factorization of n are distinct and nonrepeating.
- Number of integer 4-tuples that give the lengths of the sides of a nondegenerate quadrilateral with perimeter n.A057886
Number of integer 4-tuples that give the lengths of the sides of a nondegenerate quadrilateral with perimeter n.
- Number of 4-tuples of integers with GCD=1 and giving the lengths of sides of a nondegenerate quadrilateral with perimeter n.A057887
Number of 4-tuples of integers with GCD=1 and giving the lengths of sides of a nondegenerate quadrilateral with perimeter n.
- In Japanese: 1-digit numbers in a-i-u-e-o order, then 2-digit numbers in a-i-u-e-o order, etc.A057888
In Japanese: 1-digit numbers in a-i-u-e-o order, then 2-digit numbers in a-i-u-e-o order, etc.
- Bijective bit-reverse of n: keep the trailing zeros in the binary expansion of n fixed, but reverse all the digits up to that point.A057889
Bijective bit-reverse of n: keep the trailing zeros in the binary expansion of n fixed, but reverse all the digits up to that point.
- In base 2, either a palindrome or becomes a palindrome if trailing 0's are omitted.A057890
In base 2, either a palindrome or becomes a palindrome if trailing 0's are omitted.
- In base 2, neither a palindrome nor becomes a palindrome if trailing 0's are omitted.A057891
In base 2, neither a palindrome nor becomes a palindrome if trailing 0's are omitted.
- Negabinary numbral addition table read by antidiagonals.A057892
Negabinary numbral addition table read by antidiagonals.
- Negabinary numbral multiplication table.A057893
Negabinary numbral multiplication table.
- Negabinary numbral "primes".A057894
Negabinary numbral "primes".
- Nonnegative numbers which can be written as m^k-m [with m and k nonnegative and 0^0 taken as 1].A057895
Nonnegative numbers which can be written as m^k-m [with m and k nonnegative and 0^0 taken as 1].
- Nonnegative numbers that can be written as m^k - m (with m and k nonnegative) in more than one way.A057896
Nonnegative numbers that can be written as m^k - m (with m and k nonnegative) in more than one way.
- Numbers which can be written as m^k-k, with m, k > 1.A057897
Numbers which can be written as m^k-k, with m, k > 1.
- Largest number such that n = m^a(n) - a(n) with m a positive integer; i.e., where (n + a(n))^(1/a(n)) is a positive integer.A057898
Largest number such that n = m^a(n) - a(n) with m a positive integer; i.e., where (n + a(n))^(1/a(n)) is a positive integer.
- Smallest positive integer such that n=a(n)^k-k with k a positive integer.A057899
Smallest positive integer such that n=a(n)^k-k with k a positive integer.
- Numbers k such that 3^k + k is prime.A057900
Numbers k such that 3^k + k is prime.
- a(n) = 3^prime(n).A057901
a(n) = 3^prime(n).
- a(n) = 5^prime(n).A057902
a(n) = 5^prime(n).
- Positive integers that are not the sum of exactly two positive cubes.A057903
Positive integers that are not the sum of exactly two positive cubes.
- Positive integers that are not the sum of exactly three positive cubes.A057904
Positive integers that are not the sum of exactly three positive cubes.
- Positive integers that are not the sum of exactly four positive cubes.A057905
Positive integers that are not the sum of exactly four positive cubes.
- Positive integers that are not the sum of exactly five positive cubes.A057906
Positive integers that are not the sum of exactly five positive cubes.
- Positive integers that are not the sum of precisely six positive cubes.A057907
Positive integers that are not the sum of precisely six positive cubes.
- Numbers n such that 4^n - n is prime.A057908
Numbers n such that 4^n - n is prime.
- Numbers k such that 4^k + k is prime.A057909
Numbers k such that 4^k + k is prime.
- Numbers k such that 2*3^k - 5 is prime.A057910
Numbers k such that 2*3^k - 5 is prime.