Sequences
392,541 sequences
- Number of subsets of {1, ..., n} that are sum-free but not double-free.A088811
Number of subsets of {1, ..., n} that are sum-free but not double-free.
- Number of subsets of {1, ..., n} that are neither double-free nor sum-free.A088812
Number of subsets of {1, ..., n} that are neither double-free nor sum-free.
- Number of subsets of {1, ..., n} that are double-free or sum-free.A088813
Number of subsets of {1, ..., n} that are double-free or sum-free.
- Matrix product of unsigned Lah-triangle |A008297(n,k)| and Stirling2-triangle A008277(n,k).A088814
Matrix product of unsigned Lah-triangle |A008297(n,k)| and Stirling2-triangle A008277(n,k).
- Expansion of e.g.f. (1-x)^(-1/(1+log(1-x))).A088815
Expansion of e.g.f. (1-x)^(-1/(1+log(1-x))).
- Numbers of the form p^p - 2 where p is prime.A088816
Numbers of the form p^p - 2 where p is prime.
- Numbers k such that Cyclotomic(2k,k) is prime.A088817
Numbers k such that Cyclotomic(2k,k) is prime.
- Numbers k whose abundance-radius does not exceed log(log(k)), i.e., abs(sigma(k)-2*k) <= log(log(k)).A088818
Numbers k whose abundance-radius does not exceed log(log(k)), i.e., abs(sigma(k)-2*k) <= log(log(k)).
- Expansion of e.g.f. (1+x)^(1/(1-log(1+x))).A088819
Expansion of e.g.f. (1+x)^(1/(1-log(1+x))).
- Numbers k with abundance radius of 8, i.e., abs(sigma(k)-2*k) = 8.A088820
Numbers k with abundance radius of 8, i.e., abs(sigma(k)-2*k) = 8.
- a(n) is the sum of smallest prime factors of numbers from 1 to n.A088821
a(n) is the sum of smallest prime factors of numbers from 1 to n.
- a(n) is the sum of largest prime factors of numbers from 1 to n.A088822
a(n) is the sum of largest prime factors of numbers from 1 to n.
- a(n) is the GCD of the sum of largest prime factors of numbers from 1 to n and of the sum of smallest prime factors of numbers from 1 to n.A088823
a(n) is the GCD of the sum of largest prime factors of numbers from 1 to n and of the sum of smallest prime factors of numbers from 1 to n.
- Numbers n such that the sum of smallest prime factors of numbers from 1 to n is divisible by n.A088824
Numbers n such that the sum of smallest prime factors of numbers from 1 to n is divisible by n.
- Numbers n such that the sum of largest prime factors of numbers from 1 to n is divisible by n.A088825
Numbers n such that the sum of largest prime factors of numbers from 1 to n is divisible by n.
- Numbers k such that sigma(k)-2*k = phi(k): abundance of k equals Eulerphi of k.A088826
Numbers k such that sigma(k)-2*k = phi(k): abundance of k equals Eulerphi of k.
- Even numbers with odd abundance: even squares or two times squares.A088827
Even numbers with odd abundance: even squares or two times squares.
- Nonsquare positive odd numbers.A088828
Nonsquare positive odd numbers.
- Even numbers with even abundance.A088829
Even numbers with even abundance.
- a(n) = Min{x : sigma(x) = n*phi(x), x is not a prime}, the least nonprime solutions to sigma(x) = n*phi(x); special balanced numbers.A088830
a(n) = Min{x : sigma(x) = n*phi(x), x is not a prime}, the least nonprime solutions to sigma(x) = n*phi(x); special balanced numbers.
- Numbers k whose abundance is 2: sigma(k) - 2k = 2.A088831
Numbers k whose abundance is 2: sigma(k) - 2k = 2.
- Numbers k whose abundance is 4: sigma(k) - 2*k = 4.A088832
Numbers k whose abundance is 4: sigma(k) - 2*k = 4.
- Numbers k whose abundance is 8: sigma(k) - 2*k = 8.A088833
Numbers k whose abundance is 8: sigma(k) - 2*k = 8.
- Numbers k such that sigma(k) == 6 (mod k).A088834
Numbers k such that sigma(k) == 6 (mod k).
- a(n) = lcm(A020639(n), A006530(n)).A088835
a(n) = lcm(A020639(n), A006530(n)).
- a(n) = (A020639(2n+1) + A006530(2n+1))/2, arithmetic mean of max and min prime factor applied to odd numbers (i.e., when this mean is an integer).A088836
a(n) = (A020639(2n+1) + A006530(2n+1))/2, arithmetic mean of max and min prime factor applied to odd numbers (i.e., when this mean is an integer).
- Numerator of sigma(2*n)/sigma(n). Denominator see in A038712.A088837
Numerator of sigma(2*n)/sigma(n). Denominator see in A038712.
- Numerator of the quotient sigma(3n)/sigma(n).A088838
Numerator of the quotient sigma(3n)/sigma(n).
- Numerator of sigma(4n)/sigma(n).A088839
Numerator of sigma(4n)/sigma(n).
- Denominator of sigma(4n)/sigma(n).A088840
Denominator of sigma(4n)/sigma(n).
- Numerator of the quotient sigma(7*n)/sigma(n).A088841
Numerator of the quotient sigma(7*n)/sigma(n).
- Denominator of the quotient sigma(7n)/sigma(n).A088842
Denominator of the quotient sigma(7n)/sigma(n).
- Number of divisors of multiply-perfect numbers.A088843
Number of divisors of multiply-perfect numbers.
- Multiply perfect numbers k for which the quotient sigma_3(k)/k = A001158(k)/k is nonintegral.A088844
Multiply perfect numbers k for which the quotient sigma_3(k)/k = A001158(k)/k is nonintegral.
- Multiply perfect numbers k for which the quotient sigma_5(k)/k = A001160(k)/k is nonintegral.A088845
Multiply perfect numbers k for which the quotient sigma_5(k)/k = A001160(k)/k is nonintegral.
- Multiply perfect numbers k for which the quotient sigma_7(k)/k = A013955(k)/k is nonintegral.A088846
Multiply perfect numbers k for which the quotient sigma_7(k)/k = A013955(k)/k is nonintegral.
- a(n) = sigma(A087979(n)) / phi(A087979(n)).A088847
a(n) = sigma(A087979(n)) / phi(A087979(n)).
- Number of prime factors, without multiplicity, of numbers that can be expressed as the sum of two distinct 4th powers in exactly two distinct ways.A088848
Number of prime factors, without multiplicity, of numbers that can be expressed as the sum of two distinct 4th powers in exactly two distinct ways.
- Number of prime factors, with multiplicity, of numbers that can be expressed as the sum of two distinct 4th powers in exactly two distinct ways.A088849
Number of prime factors, with multiplicity, of numbers that can be expressed as the sum of two distinct 4th powers in exactly two distinct ways.
- Number of different values of k when A056239(k) = A056239(k+1) = n.A088850
Number of different values of k when A056239(k) = A056239(k+1) = n.
- Products of integers whose digits are permutations of 1, 2, 3, ..., n.A088851
Products of integers whose digits are permutations of 1, 2, 3, ..., n.
- Number of n X n matrices over GF(4) with characteristic polynomial x^(n-1) * (x-1).A088852
Number of n X n matrices over GF(4) with characteristic polynomial x^(n-1) * (x-1).
- Number of n X n matrices over GF(5) with characteristic polynomial x^(n-1) * (x-1).A088853
Number of n X n matrices over GF(5) with characteristic polynomial x^(n-1) * (x-1).
- a(n) = (2^(n-1))*(Integral_{x=0..1} (1+x^2)^n dx)/(Integral_{x=0..1} (1-x^2)^n dx).A088854
a(n) = (2^(n-1))*(Integral_{x=0..1} (1+x^2)^n dx)/(Integral_{x=0..1} (1-x^2)^n dx).
- Triangle read by rows: number of symmetric Dyck paths of semilength n with k peaks.A088855
Triangle read by rows: number of symmetric Dyck paths of semilength n with k peaks.
- Primes p such that cyclotomic(p,p-1) is prime.A088856
Primes p such that cyclotomic(p,p-1) is prime.
- Let Product[1+Sum[b(i,j) x^(i*j),{i,1,Infinity}],{j,1,Infinity}]=1+Sum[c(n) x^n,{n,1,Infinity}], where b(i,j) is plus or minus one and c(n) is plus or minus one or zero. Furthermore, let b(1,1)=1 (for definiteness). Then, for a given n, a(n) is the number of ways in which the coefficients b(i,j) i<=n, j<=n can be chosen.A088857
Let Product[1+Sum[b(i,j) x^(i*j),{i,1,Infinity}],{j,1,Infinity}]=1+Sum[c(n) x^n,{n,1,Infinity}], where b(i,j) is plus or minus one and c(n) is plus or minus one or zero. Furthermore, let b(1,1)=1 (for definiteness). Then, for a given n, a(n) is the number of ways in which the coefficients b(i,j) i<=n, j<=n can be chosen.
- Define a Fibonacci-type sequence to be one of the form s(0) = s_1 >= 1, s(1) = s_2 >= 1, s(n+2) = s(n+1) + s(n); then a(n) = maximal m such that n is the m-th term in some Fibonacci-type sequence.A088858
Define a Fibonacci-type sequence to be one of the form s(0) = s_1 >= 1, s(1) = s_2 >= 1, s(n+2) = s(n+1) + s(n); then a(n) = maximal m such that n is the m-th term in some Fibonacci-type sequence.
- a(n) = L(n) + 2^n where L(n) = A000032(n) (the Lucas numbers).A088859
a(n) = L(n) + 2^n where L(n) = A000032(n) (the Lucas numbers).
- Twice the primorials (first definition), 2*A002110(n).A088860
Twice the primorials (first definition), 2*A002110(n).