Sequences
392,541 sequences
- Column 5 of triangle A055907.A055911
Column 5 of triangle A055907.
- Column 6 of triangle A055907.A055912
Column 6 of triangle A055907.
- Column 7 of triangle A055907.A055913
Column 7 of triangle A055907.
- Column 8 of triangle A055907.A055914
Column 8 of triangle A055907.
- Column 9 of triangle A055907.A055915
Column 9 of triangle A055907.
- Coefficients of a polynomial used in calculation of A055913.A055916
Coefficients of a polynomial used in calculation of A055913.
- Coefficients of a polynomial used in calculation of A055914.A055917
Coefficients of a polynomial used in calculation of A055914.
- Coefficients of a polynomial used in calculation of A055915.A055918
Coefficients of a polynomial used in calculation of A055915.
- Number of directed site animals on hexagonal net (honeycomb) with n sites.A055919
Number of directed site animals on hexagonal net (honeycomb) with n sites.
- Susceptibility series H_4 for 2-dimensional Ising model (divided by 2) for 1 particle excitation.A055920
Susceptibility series H_4 for 2-dimensional Ising model (divided by 2) for 1 particle excitation.
- Array giving susceptibility of 2-dimensional Ising model for 1 particle excitation (read by antidiagonals).A055921
Array giving susceptibility of 2-dimensional Ising model for 1 particle excitation (read by antidiagonals).
- Number of partitions of n in which each part occurs an odd number (or zero) times.A055922
Number of partitions of n in which each part occurs an odd number (or zero) times.
- Number of partitions of n in which each part occurs a prime number (or 0) times.A055923
Number of partitions of n in which each part occurs a prime number (or 0) times.
- Exponential transform of Stirling1 triangle A008275.A055924
Exponential transform of Stirling1 triangle A008275.
- Exponential reciprocal of A055924.A055925
Exponential reciprocal of A055924.
- Numbers k such that {largest m such that 1, 2, ..., m divide k} is different from {largest m such that m! divides k}; numbers k which are either odd multiples of 12 or the largest m such that (m-1)! divides k is a composite number > 5.A055926
Numbers k such that {largest m such that 1, 2, ..., m divide k} is different from {largest m such that m! divides k}; numbers k which are either odd multiples of 12 or the largest m such that (m-1)! divides k is a composite number > 5.
- Numbers k such that k + 1 has one more divisor than k.A055927
Numbers k such that k + 1 has one more divisor than k.
- Sum of square divisors of n! = sum of squares of divisors of the square root of largest square dividing n!.A055928
Sum of square divisors of n! = sum of squares of divisors of the square root of largest square dividing n!.
- Euler totient function of the factorial of prime(n).A055929
Euler totient function of the factorial of prime(n).
- Number of distinct prime factors of totient of (n-th prime)!.A055930
Number of distinct prime factors of totient of (n-th prime)!.
- Product of the digits of n divides the sum of the digits of n.A055931
Product of the digits of n divides the sum of the digits of n.
- Numbers all of whose prime divisors are consecutive primes starting at 2.A055932
Numbers all of whose prime divisors are consecutive primes starting at 2.
- Product of digits (not counting zeros) of n divides sum of digits of n.A055933
Product of digits (not counting zeros) of n divides sum of digits of n.
- a(0) = 1; a(n) = sum of a(j)'s, j<n, where n is divisible by a(j).A055934
a(0) = 1; a(n) = sum of a(j)'s, j<n, where n is divisible by a(j).
- a(0)=1; a(n) = Sum_{j<n, gcd(n,a(j)) = 1} a(j).A055935
a(0)=1; a(n) = Sum_{j<n, gcd(n,a(j)) = 1} a(j).
- Stereoisomeric homologs with molecular formula C_{3+n} H_{6+2n}.A055936
Stereoisomeric homologs with molecular formula C_{3+n} H_{6+2n}.
- a(n) = a(n-1) * a(n-2) - 1.A055937
a(n) = a(n-1) * a(n-2) - 1.
- Integers not generated by b(n) = b(floor(n/2)) + n (complement of A005187).A055938
Integers not generated by b(n) = b(floor(n/2)) + n (complement of A005187).
- Primes p such that p | ((p-1)/2)! + 1.A055939
Primes p such that p | ((p-1)/2)! + 1.
- Counterbalanced numbers: Composite numbers k such that phi(k)/(sigma(k)-k) is an integer.A055940
Counterbalanced numbers: Composite numbers k such that phi(k)/(sigma(k)-k) is an integer.
- a(n) = Sum_{j=0..k-1} (i(j) - j) where n = Sum_{j=0..k-1} 2^i(j).A055941
a(n) = Sum_{j=0..k-1} (i(j) - j) where n = Sum_{j=0..k-1} 2^i(j).
- Smallest k > 1 such that k | Sigma(k) + n.A055942
Smallest k > 1 such that k | Sigma(k) + n.
- Smallest k >1 such that k | Sigma(k) - n.A055943
Smallest k >1 such that k | Sigma(k) - n.
- a(n) = n + (reversal of base-2 digits of n) (written in base 10).A055944
a(n) = n + (reversal of base-2 digits of n) (written in base 10).
- a(n) = n - (reversal of base-2 digits of n) (and then the result is written in base 10).A055945
a(n) = n - (reversal of base-2 digits of n) (and then the result is written in base 10).
- n + reversal of base 3 digits of n (written in base 10).A055946
n + reversal of base 3 digits of n (written in base 10).
- n - reversal of base 3 digits of n (written in base 10).A055947
n - reversal of base 3 digits of n (written in base 10).
- n + reversal of base 4 digits of n (written in base 10).A055948
n + reversal of base 4 digits of n (written in base 10).
- n - reversal of base 4 digits of n (written in base 10).A055949
n - reversal of base 4 digits of n (written in base 10).
- a(n) = n + reversal of base 5 digits of n (written in base 10).A055950
a(n) = n + reversal of base 5 digits of n (written in base 10).
- n - reversal of base 5 digits of n (written in base 10).A055951
n - reversal of base 5 digits of n (written in base 10).
- n + reversal of base 6 digits of n (written in base 10).A055952
n + reversal of base 6 digits of n (written in base 10).
- n - reversal of base 6 digits of n (written in base 10).A055953
n - reversal of base 6 digits of n (written in base 10).
- a(n) = n + reversal of base 7 digits of n (written in base 10).A055954
a(n) = n + reversal of base 7 digits of n (written in base 10).
- a(n) = n - reversal of base 7 digits of n (written in base 10).A055955
a(n) = n - reversal of base 7 digits of n (written in base 10).
- n + reversal of base 8 digits of n (written in base 10).A055956
n + reversal of base 8 digits of n (written in base 10).
- n - reversal of base 8 digits of n (written in base 10).A055957
n - reversal of base 8 digits of n (written in base 10).
- a(n) = n + reversal of base 9 digits of n (written in base 10).A055958
a(n) = n + reversal of base 9 digits of n (written in base 10).
- n - reversal of base 9 digits of n (written in base 10).A055959
n - reversal of base 9 digits of n (written in base 10).
- n + reversal of base 11 digits of n (written in base 10).A055960
n + reversal of base 11 digits of n (written in base 10).