Sequences
392,541 sequences
- Maximal number of binary vectors of length n such that the unions (or bitwise ORs) of any 2 distinct vectors are all distinct.A054961
Maximal number of binary vectors of length n such that the unions (or bitwise ORs) of any 2 distinct vectors are all distinct.
- Number of different solutions to problem in A054961.A054962
Number of different solutions to problem in A054961.
- Number of cells in the first column of all directed column-convex polyominoes of area n+1.A054963
Number of cells in the first column of all directed column-convex polyominoes of area n+1.
- Numbers whose divisors have the form m^k + 1, k>1.A054964
Numbers whose divisors have the form m^k + 1, k>1.
- Beatty sequence for log_3(10), i.e., for 1/log_10(3); so largest exponent of 3 which produces an n-digit decimal number.A054965
Beatty sequence for log_3(10), i.e., for 1/log_10(3); so largest exponent of 3 which produces an n-digit decimal number.
- Numbers that are congruent to {0, 1, 8} mod 9.A054966
Numbers that are congruent to {0, 1, 8} mod 9.
- Numbers that are congruent to {0, 1, 9} mod 10.A054967
Numbers that are congruent to {0, 1, 9} mod 10.
- 3*Fibonacci(n) - 11.A054968
3*Fibonacci(n) - 11.
- Palindromic hexagonal numbers.A054969
Palindromic hexagonal numbers.
- Index numbers for palindromic hexagonal numbers.A054970
Index numbers for palindromic hexagonal numbers.
- n(5n-3)/2 is a palindromic heptagonal number.A054971
n(5n-3)/2 is a palindromic heptagonal number.
- Product of (sum of first n primes) and (product of first n primes).A054972
Product of (sum of first n primes) and (product of first n primes).
- Number of numbers whose divisors sum to n.A054973
Number of numbers whose divisors sum to n.
- Number of nonnegative integer 2 X 2 matrices with no zero rows or columns and with sum of elements equal to n, up to row and column permutation.A054974
Number of nonnegative integer 2 X 2 matrices with no zero rows or columns and with sum of elements equal to n, up to row and column permutation.
- Number of nonnegative integer 3 X 3 matrices with no zero rows or columns and with sum of elements equal to n, up to row and column permutation.A054975
Number of nonnegative integer 3 X 3 matrices with no zero rows or columns and with sum of elements equal to n, up to row and column permutation.
- Number of binary n X n matrices with no zero rows or columns, up to row and column permutation.A054976
Number of binary n X n matrices with no zero rows or columns, up to row and column permutation.
- a(0)=2, a(n)=1 for n >= 1.A054977
a(0)=2, a(n)=1 for n >= 1.
- Obtained from sequence of lucky numbers (A000959) by taking iterated absolute value differences of terms and extracting the leading diagonal.A054978
Obtained from sequence of lucky numbers (A000959) by taking iterated absolute value differences of terms and extracting the leading diagonal.
- e-perfect numbers: numbers k such that the sum of the e-divisors (exponential divisors) of k equals 2*k.A054979
e-perfect numbers: numbers k such that the sum of the e-divisors (exponential divisors) of k equals 2*k.
- Primitive e-perfect numbers: primitive elements of the e-perfect numbers (A054979).A054980
Primitive e-perfect numbers: primitive elements of the e-perfect numbers (A054979).
- Number of certain connected weighted pseudo-graphs.A054981
Number of certain connected weighted pseudo-graphs.
- a(n) = least composite number such that sigma(a(n)+n!) = sigma(a(n))+n! where sigma() = A000203.A054982
a(n) = least composite number such that sigma(a(n)+n!) = sigma(a(n))+n! where sigma() = A000203.
- Composite numbers n such that sigma(n+24) = sigma(n) + 24.A054983
Composite numbers n such that sigma(n+24) = sigma(n) + 24.
- Composite numbers k such that sigma(k + 6!) = sigma(k + 720) = sigma(k) + 720.A054984
Composite numbers k such that sigma(k + 6!) = sigma(k + 720) = sigma(k) + 720.
- Composite numbers x such that sigma(x+120) = sigma(x)+120.A054985
Composite numbers x such that sigma(x+120) = sigma(x)+120.
- Base-10 modest numbers.A054986
Base-10 modest numbers.
- Smallest composite x such that sigma(x+2^n) = sigma(x) + 2^n.A054987
Smallest composite x such that sigma(x+2^n) = sigma(x) + 2^n.
- Number of prime divisors of 1 + (product of first n primes), with multiplicity.A054988
Number of prime divisors of 1 + (product of first n primes), with multiplicity.
- Number of prime divisors of -1 + (product of first n primes).A054989
Number of prime divisors of -1 + (product of first n primes).
- Number of prime divisors of n! + 1 (counted with multiplicity).A054990
Number of prime divisors of n! + 1 (counted with multiplicity).
- Number of prime divisors of n! - 1 (counted with multiplicity).A054991
Number of prime divisors of n! - 1 (counted with multiplicity).
- Number of prime factors of 2^n + 1 (counted with multiplicity).A054992
Number of prime factors of 2^n + 1 (counted with multiplicity).
- Number of "long curves", i.e., topological types of smooth embeddings of the oriented real line into the oriented plane that coincide with the standard immersion x -> (x,0) in the neighborhood of -infinity and +infinity.A054993
Number of "long curves", i.e., topological types of smooth embeddings of the oriented real line into the oriented plane that coincide with the standard immersion x -> (x,0) in the neighborhood of -infinity and +infinity.
- Numbers of the form q1^b1 * q2^b2 * q3^b3 * q4^b4 * q5^b5 * ... where q1=5, q2=13, q3=17, q4=29, q5=37, ... (A002144) and b1 >= b2 >= b3 >= b4 >= b5 >= ....A054994
Numbers of the form q1^b1 * q2^b2 * q3^b3 * q4^b4 * q5^b5 * ... where q1=5, q2=13, q3=17, q4=29, q5=37, ... (A002144) and b1 >= b2 >= b3 >= b4 >= b5 >= ....
- A version of Josephus problem: a(n) is the surviving integer under the following elimination process. Arrange 1,2,3,...,n in a circle, increasing clockwise. Starting with i=1, delete the integer two places clockwise from i. Repeat, counting two places from the next undeleted integer, until only one integer remains.A054995
A version of Josephus problem: a(n) is the surviving integer under the following elimination process. Arrange 1,2,3,...,n in a circle, increasing clockwise. Starting with i=1, delete the integer two places clockwise from i. Repeat, counting two places from the next undeleted integer, until only one integer remains.
- Integers that can be expressed as the sum of consecutive primes in exactly 1 way.A054996
Integers that can be expressed as the sum of consecutive primes in exactly 1 way.
- Integers that can be expressed as the sum of consecutive primes in exactly 2 ways.A054997
Integers that can be expressed as the sum of consecutive primes in exactly 2 ways.
- Integers that can be expressed as the sum of consecutive primes in exactly 3 ways.A054998
Integers that can be expressed as the sum of consecutive primes in exactly 3 ways.
- Integers that can be expressed as the sum of consecutive primes in exactly 4 ways.A054999
Integers that can be expressed as the sum of consecutive primes in exactly 4 ways.
- Integers that can be expressed as the sum of consecutive primes in exactly 5 ways.A055000
Integers that can be expressed as the sum of consecutive primes in exactly 5 ways.
- Integers that can be expressed as the sum of consecutive primes in exactly 6 ways.A055001
Integers that can be expressed as the sum of consecutive primes in exactly 6 ways.
- Erroneous version of A000009.A055002
Erroneous version of A000009.
- a(n) = prime(prime(n)-1).A055003
a(n) = prime(prime(n)-1).
- Boris Stechkin's function.A055004
Boris Stechkin's function.
- Number of nonnegative integer 3 X 3 matrices with no zero rows or columns and with sum of elements equal to n.A055005
Number of nonnegative integer 3 X 3 matrices with no zero rows or columns and with sum of elements equal to n.
- a(n) is the least multiple of n such that a(n) = 1 mod k for all integers k with 1 < k < n and k relatively prime to n.A055006
a(n) is the least multiple of n such that a(n) = 1 mod k for all integers k with 1 < k < n and k relatively prime to n.
- Number of nonnegative integer 4 X 4 matrices with no zero rows or columns and with sum of elements equal to n.A055007
Number of nonnegative integer 4 X 4 matrices with no zero rows or columns and with sum of elements equal to n.
- Numbers k such that gcd(phi(k), sigma(k)) = 1 with phi = A000010, sigma = A000203.A055008
Numbers k such that gcd(phi(k), sigma(k)) = 1 with phi = A000010, sigma = A000203.
- Smallest composite number x such that sigma(x + prime(n)#) = sigma(x) + prime(n)#, where prime(n)# = A002110(n) and sigma is A000203.A055009
Smallest composite number x such that sigma(x + prime(n)#) = sigma(x) + prime(n)#, where prime(n)# = A002110(n) and sigma is A000203.
- a(0) = 0; for n > 0, a(n) = 3*2^(n-1) - 1.A055010
a(0) = 0; for n > 0, a(n) = 3*2^(n-1) - 1.