Sequences
392,541 sequences
- Plug g.f. for A000108 (minus the leading 1), 1/2*(1-(1-4*x)^(1/2))/x - 1, into cycle index for dihedral group D_3.A056711
Plug g.f. for A000108 (minus the leading 1), 1/2*(1-(1-4*x)^(1/2))/x - 1, into cycle index for dihedral group D_3.
- Numbers n such that 5*10^n-1 is prime.A056712
Numbers n such that 5*10^n-1 is prime.
- Numbers k such that 5*10^k + R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056713
Numbers k such that 5*10^k + R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 5*10^k + 3*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056714
Numbers k such that 5*10^k + 3*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 5*10^k + 7*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056715
Numbers k such that 5*10^k + 7*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers n such that 6*10^n-1 is prime.A056716
Numbers n such that 6*10^n-1 is prime.
- Numbers k such that 6*10^k + R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056717
Numbers k such that 6*10^k + R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that (61*10^k - 7)/9 is prime.A056718
Numbers k such that (61*10^k - 7)/9 is prime.
- Numbers k such that 7*10^k + R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056719
Numbers k such that 7*10^k + R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 7*10^k + 3*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056720
Numbers k such that 7*10^k + 3*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 8*10^k-1 is prime.A056721
Numbers k such that 8*10^k-1 is prime.
- Numbers k such that 8*10^k + R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056722
Numbers k such that 8*10^k + R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 8*10^k + 3*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056723
Numbers k such that 8*10^k + 3*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 8*10^k + 7*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056724
Numbers k such that 8*10^k + 7*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 9*10^k - 1 is prime.A056725
Numbers k such that 9*10^k - 1 is prime.
- Numbers k such that 9*10^k + R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056726
Numbers k such that 9*10^k + R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 9*10^k + 7*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056727
Numbers k such that 9*10^k + 7*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Palindromic primes using only two distinct digits and only the exterior digit is different.A056728
Palindromic primes using only two distinct digits and only the exterior digit is different.
- If p | n, then p+1 | n+1 for composite n.A056729
If p | n, then p+1 | n+1 for composite n.
- Palindromic primes with just two distinct digits.A056730
Palindromic primes with just two distinct digits.
- First differences of A030124.A056731
First differences of A030124.
- Smallest palindromic prime using n digits, or 0 if no such number exists.A056732
Smallest palindromic prime using n digits, or 0 if no such number exists.
- Each number is the sum of the cubes of its 3 sections.A056733
Each number is the sum of the cubes of its 3 sections.
- Positive numbers k such that, in base 3, 2^k and 2^(k+1) have the same number of digits and the same number of 0's.A056734
Positive numbers k such that, in base 3, 2^k and 2^(k+1) have the same number of digits and the same number of 0's.
- Numbers k such that the base-3 expansions of 2^k and 2^(k+1) have the same number of 1's and the same number of digits.A056735
Numbers k such that the base-3 expansions of 2^k and 2^(k+1) have the same number of 1's and the same number of digits.
- Numbers n such that 2^n in base 3 has same number of 2's as 2^(n+1) in base 3 and 2^n and 2^(n+1) have the same number of digits in base 3.A056736
Numbers n such that 2^n in base 3 has same number of 2's as 2^(n+1) in base 3 and 2^n and 2^(n+1) have the same number of digits in base 3.
- Minimum nonnegative integer m such that n = k*(k+m) for some positive integer k.A056737
Minimum nonnegative integer m such that n = k*(k+m) for some positive integer k.
- Positions where 2's occur in A056731.A056738
Positions where 2's occur in A056731.
- Numbers k such that k | 10^k + 9^k + 8^k + 7^k + 6^k + 5^k + 4^k + 3^k + 2^k + 1^k.A056739
Numbers k such that k | 10^k + 9^k + 8^k + 7^k + 6^k + 5^k + 4^k + 3^k + 2^k + 1^k.
- Odd numbers k such that 2^k mod k = 2^(k+2) mod (k-2) is also an odd number.A056740
Odd numbers k such that 2^k mod k = 2^(k+2) mod (k-2) is also an odd number.
- Numbers k such that k | 5^k + 4^k + 3^k + 2^k + 1^k.A056741
Numbers k such that k | 5^k + 4^k + 3^k + 2^k + 1^k.
- a(n) = phi(2^n - 1)/2.A056742
a(n) = phi(2^n - 1)/2.
- a(n) = phi(2^prime(n) - 1)/prime(n); a(0) = 0 by convention.A056743
a(n) = phi(2^prime(n) - 1)/prime(n); a(0) = 0 by convention.
- a(n) is the smallest number which when written in binary contains as substrings the binary expansions of 1..n.A056744
a(n) is the smallest number which when written in binary contains as substrings the binary expansions of 1..n.
- Numbers k such that k | 6^k + 5^k + 4^k + 3^k + 2^k + 1^k.A056745
Numbers k such that k | 6^k + 5^k + 4^k + 3^k + 2^k + 1^k.
- Number of raw solutions to Hi-Q puzzle with n holes on a side, any initial peg removed.A056746
Number of raw solutions to Hi-Q puzzle with n holes on a side, any initial peg removed.
- Number of raw solutions to Hi-Q puzzle with n holes on a side, any initial peg removed, final peg in top hole.A056747
Number of raw solutions to Hi-Q puzzle with n holes on a side, any initial peg removed, final peg in top hole.
- Number of raw solutions to Hi-Q puzzle with n holes on a side, any initial peg removed, final peg in initial empty hole.A056748
Number of raw solutions to Hi-Q puzzle with n holes on a side, any initial peg removed, final peg in initial empty hole.
- Smallest palindrome greater than n in bases 2 and n.A056749
Smallest palindrome greater than n in bases 2 and n.
- Numbers n such that n | 7^n + 6^n + 5^n + 4^n + 3^n + 2^n + 1^n.A056750
Numbers n such that n | 7^n + 6^n + 5^n + 4^n + 3^n + 2^n + 1^n.
- Numbers n such that n | 8^n + 7^n + 6^n + 5^n + 4^n + 3^n + 2^n + 1^n.A056751
Numbers n such that n | 8^n + 7^n + 6^n + 5^n + 4^n + 3^n + 2^n + 1^n.
- Distance from n! to the nearest prime.A056752
Distance from n! to the nearest prime.
- Only odd numbers occur and for all k there are k numbers between any two successive occurrences of k.A056753
Only odd numbers occur and for all k there are k numbers between any two successive occurrences of k.
- Numbers n such that n | 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n + 2^n + 1^n.A056754
Numbers n such that n | 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n + 2^n + 1^n.
- Number of n-celled polyominoes, where the cells are 1 X 2 rectangles with some of the edges of length 2 replaced by curved arcs that either sag inwards or bulge outwards.A056755
Number of n-celled polyominoes, where the cells are 1 X 2 rectangles with some of the edges of length 2 replaced by curved arcs that either sag inwards or bulge outwards.
- Where n-th prime appears in Euclid-Mullin sequence A000945.A056756
Where n-th prime appears in Euclid-Mullin sequence A000945.
- Cube of number of divisors is larger than the number.A056757
Cube of number of divisors is larger than the number.
- Numbers n for which d(n)^3 < n.A056758
Numbers n for which d(n)^3 < n.
- The 17 prime powers k = p^w such that d(p^w)^3 > p^w where d = A000005().A056759
The 17 prime powers k = p^w such that d(p^w)^3 > p^w where d = A000005().
- Integers with exactly 2 prime divisors such that the cube of the number of divisors exceeds the number.A056760
Integers with exactly 2 prime divisors such that the cube of the number of divisors exceeds the number.