Sequences
392,541 sequences
- Number of n-step self-avoiding walks on the square lattice with first step specified.A046661
Number of n-step self-avoiding walks on the square lattice with first step specified.
- Sum of mistyped version of binomial coefficients.A046662
Sum of mistyped version of binomial coefficients.
- Triangle: T(n,k) = number of partitions of n (>=2) with no subsum equal to k (1 <= k <= n-1).A046663
Triangle: T(n,k) = number of partitions of n (>=2) with no subsum equal to k (1 <= k <= n-1).
- Erroneous version of A028419.A046664
Erroneous version of A028419.
- Largest prime divisor of n - smallest prime divisor of n (a(1)=0).A046665
Largest prime divisor of n - smallest prime divisor of n (a(1)=0).
- a(n) = n - (smallest prime dividing n).A046666
a(n) = n - (smallest prime dividing n).
- a(n) = A046666(n)/2.A046667
a(n) = A046666(n)/2.
- Numbers n such that partition function p(n) divides n!.A046668
Numbers n such that partition function p(n) divides n!.
- Partial sums of A020639.A046669
Partial sums of A020639.
- Partial sums of A006530.A046670
Partial sums of A006530.
- Nim-values G(3,n) for Sylver coinage.A046671
Nim-values G(3,n) for Sylver coinage.
- Expansion of 1/(1-2*x-3*x^2+2*x^3).A046672
Expansion of 1/(1-2*x-3*x^2+2*x^3).
- a(n) = (2n)!*Sum_{i=1..n} 1/i.A046673
a(n) = (2n)!*Sum_{i=1..n} 1/i.
- a(n) = A046673(n)/2.A046674
a(n) = A046673(n)/2.
- Expansion of Product_{i>0} (1-x^{p_i}), where p_i are the primes.A046675
Expansion of Product_{i>0} (1-x^{p_i}), where p_i are the primes.
- Expansion of 1 + Sum_{k>=1} x^(p_1+p_2+...+p_k)/((1-x)*(1-x^2)*(1-x^3)*...*(1-x^k)) (where p_i are the primes).A046676
Expansion of 1 + Sum_{k>=1} x^(p_1+p_2+...+p_k)/((1-x)*(1-x^2)*(1-x^3)*...*(1-x^k)) (where p_i are the primes).
- Number of primes p of the form p = 4m^2+1 for n^2 < m < (n+1)^2.A046677
Number of primes p of the form p = 4m^2+1 for n^2 < m < (n+1)^2.
- Number of divisors of n and sum of divisors of n are relatively prime.A046678
Number of divisors of n and sum of divisors of n are relatively prime.
- Numbers k such that the number of divisors of k and sum of squares of divisors of k are relatively prime.A046679
Numbers k such that the number of divisors of k and sum of squares of divisors of k are relatively prime.
- Numbers k such that the number of divisors of k and sum of cubes of divisors of k are relatively prime.A046680
Numbers k such that the number of divisors of k and sum of cubes of divisors of k are relatively prime.
- Numbers k such that the number of divisors of k and sum of 4th powers of divisors of k are relatively prime.A046681
Numbers k such that the number of divisors of k and sum of 4th powers of divisors of k are relatively prime.
- Number of cycle types of conjugacy classes of all even permutations of n elements.A046682
Number of cycle types of conjugacy classes of all even permutations of n elements.
- Numbers k such that the sum of squares of divisors of k and sum of cubes of divisors of k are relatively prime.A046683
Numbers k such that the sum of squares of divisors of k and sum of cubes of divisors of k are relatively prime.
- Numbers k such that k and sum of squares of divisors of k are relatively prime.A046684
Numbers k such that k and sum of squares of divisors of k are relatively prime.
- Numbers k such that the sum of cubes of divisors of k and the sum of 4th powers of divisors of k are relatively prime.A046685
Numbers k such that the sum of cubes of divisors of k and the sum of 4th powers of divisors of k are relatively prime.
- Numbers k such that k and sum of cubes of divisors of k are relatively prime.A046686
Numbers k such that k and sum of cubes of divisors of k are relatively prime.
- Numbers k such that k and sum of 4th powers of divisors of k are relatively prime.A046687
Numbers k such that k and sum of 4th powers of divisors of k are relatively prime.
- Antidiagonals of square array in which k-th row (k>0) is an arithmetic progression of difference 2^(k-1).A046688
Antidiagonals of square array in which k-th row (k>0) is an arithmetic progression of difference 2^(k-1).
- Primes p such that p+1 divides 24.A046689
Primes p such that p+1 divides 24.
- Duplicate of A008828.A046690
Duplicate of A008828.
- a(n) = (n^2 + 5*n - 2)/2.A046691
a(n) = (n^2 + 5*n - 2)/2.
- Dirichlet inverse of sigma function (A000203).A046692
Dirichlet inverse of sigma function (A000203).
- Size of smallest subset S of N={0,1,2,...,n} such that S-S=N, where S-S={abs(i-j) | i,j in S}.A046693
Size of smallest subset S of N={0,1,2,...,n} such that S-S=N, where S-S={abs(i-j) | i,j in S}.
- Ramanujan tau numbers mod 691 = sum of 11th power of divisors mod 691.A046694
Ramanujan tau numbers mod 691 = sum of 11th power of divisors mod 691.
- Sprague-Grundy values for the game Couples-are-Forever (and for octal games .6, .601, .61, .611, .62, .621, .63, .631).A046695
Sprague-Grundy values for the game Couples-are-Forever (and for octal games .6, .601, .61, .611, .62, .621, .63, .631).
- Nim-value of 0 for Couples-are-Forever occurs for these heap sizes.A046696
Nim-value of 0 for Couples-are-Forever occurs for these heap sizes.
- Number of catacondensed simply-connected monopentapolyhexes (catafusenes).A046697
Number of catacondensed simply-connected monopentapolyhexes (catafusenes).
- a(0) = 0, a(1) = 1, a(n) = a(a(n-1)) + a(a(n-2)) if n > 1.A046698
a(0) = 0, a(1) = 1, a(n) = a(a(n-1)) + a(a(n-2)) if n > 1.
- a(1) = a(2) = 1, a(n) = a(n - a(n-1)) + a(n-1 - a(n-2)) if n > 2.A046699
a(1) = a(2) = 1, a(n) = a(n - a(n-1)) + a(n-1 - a(n-2)) if n > 2.
- a(1) = a(2) = a(3) = 1, a(n) = a(n - a(n-1)) + a(n - a(n-3)) for 3 < n < 165.A046700
a(1) = a(2) = a(3) = 1, a(n) = a(n - a(n-1)) + a(n - a(n-3)) for 3 < n < 165.
- a(1) = a(2) = a(3) = 1, a(n) = a(n - a(n-1)) + a(n-1 - a(n-3)) (n > 3).A046701
a(1) = a(2) = a(3) = 1, a(n) = a(n - a(n-1)) + a(n-1 - a(n-3)) (n > 3).
- a(n)=a(n-a(n-1))+a(n-1-a(n-2))+a(n-2-a(n-3)), n>3. a(1)=a(2)=a(3)=1.A046702
a(n)=a(n-a(n-1))+a(n-1-a(n-2))+a(n-2-a(n-3)), n>3. a(1)=a(2)=a(3)=1.
- Multiplicative primes: product of digits is a prime.A046703
Multiplicative primes: product of digits is a prime.
- Additive primes: sum of digits is a prime.A046704
Additive primes: sum of digits is a prime.
- Palindromic primes whose product of digits is a prime.A046705
Palindromic primes whose product of digits is a prime.
- a(n) = (1/2)*(n+1)!*Sum_{k=0..floor(n/2)} n^(2k+1)/(2k+1)!.A046706
a(n) = (1/2)*(n+1)!*Sum_{k=0..floor(n/2)} n^(2k+1)/(2k+1)!.
- a(n) = n!*Sum_{k=0..n/2} n^(2k)/(2k)!.A046707
a(n) = n!*Sum_{k=0..n/2} n^(2k)/(2k)!.
- Erroneous version of A007281.A046708
Erroneous version of A007281.
- Irrational unitary phi amicable number: numbers b such that uphi(a) = uphi(b) = 2*(a^2-b^2)^(1/2) where uphi = A047994.A046709
Irrational unitary phi amicable number: numbers b such that uphi(a) = uphi(b) = 2*(a^2-b^2)^(1/2) where uphi = A047994.
- Irrational unitary-phi amicable numbers: numbers a such that uphi(a) = uphi(b) = 2*(a^2-b^2)^(1/2) where uphi = A047994.A046710
Irrational unitary-phi amicable numbers: numbers a such that uphi(a) = uphi(b) = 2*(a^2-b^2)^(1/2) where uphi = A047994.