Sequences
392,541 sequences
- Arithmetic derivative of n!.A068311
Arithmetic derivative of n!.
- Arithmetic derivative of triangular numbers.A068312
Arithmetic derivative of triangular numbers.
- Number of (0,1)-matrices with sum of entries equal to n and no zero rows or columns, with weakly decreasing row sums and column sums.A068313
Number of (0,1)-matrices with sum of entries equal to n and no zero rows or columns, with weakly decreasing row sums and column sums.
- Smallest integer that can be expressed as the sum of consecutive odd numbers in exactly n ways.A068314
Smallest integer that can be expressed as the sum of consecutive odd numbers in exactly n ways.
- For numbers k such that A025474(k) > 1 and A025474(k+1) > 1, sequence gives A000961(k).A068315
For numbers k such that A025474(k) > 1 and A025474(k+1) > 1, sequence gives A000961(k).
- Run lengths of the Moebius function applied to A051270 (numbers with 5 distinct prime factors).A068316
Run lengths of the Moebius function applied to A051270 (numbers with 5 distinct prime factors).
- Numbers n such that n*tau(n) > omega(n)*prime(n) where tau(n) is the number of divisors of n and omega(n) the number of distinct prime factors of n.A068317
Numbers n such that n*tau(n) > omega(n)*prime(n) where tau(n) is the number of divisors of n and omega(n) the number of distinct prime factors of n.
- Sum of prime factors of n-th semiprime.A068318
Sum of prime factors of n-th semiprime.
- a(n) = if n <= lpf(n)^2 then lpf(n) else a(lpf(n) + n/lpf(n)), where lpf = least prime factor, A020639.A068319
a(n) = if n <= lpf(n)^2 then lpf(n) else a(lpf(n) + n/lpf(n)), where lpf = least prime factor, A020639.
- a(n)=number of arithmetic progressions of primes, strictly increasing with sum n.A068320
a(n)=number of arithmetic progressions of primes, strictly increasing with sum n.
- Numbers that are not the sum of arithmetic progressions of distinct primes including arithmetic progressions of length 1.A068321
Numbers that are not the sum of arithmetic progressions of distinct primes including arithmetic progressions of length 1.
- Number of arithmetic progressions of positive odd integers, strictly increasing with sum n.A068322
Number of arithmetic progressions of positive odd integers, strictly increasing with sum n.
- a(n)=number of arithmetic progressions of primes, nondecreasing with sum n.A068323
a(n)=number of arithmetic progressions of primes, nondecreasing with sum n.
- Number of nondecreasing arithmetic progressions of positive odd integers with sum n.A068324
Number of nondecreasing arithmetic progressions of positive odd integers with sum n.
- Self-conjugate digitized partition numbers.A068325
Self-conjugate digitized partition numbers.
- a(n) = Product_{k=1..n} A031974(k).A068326
a(n) = Product_{k=1..n} A031974(k).
- Arithmetic derivative of n^n.A068327
Arithmetic derivative of n^n.
- Arithmetic derivatives of the squarefree numbers.A068328
Arithmetic derivatives of the squarefree numbers.
- Arithmetic derivative of Fibonacci numbers > 0.A068329
Arithmetic derivative of Fibonacci numbers > 0.
- Consider all sublists of [(2,1),(3,2,1),(4,3,2,1),...,(n,...,4,3,2,1)] and multiply these permutations in that order. How many of the products are n-cycles?A068330
Consider all sublists of [(2,1),(3,2,1),(4,3,2,1),...,(n,...,4,3,2,1)] and multiply these permutations in that order. How many of the products are n-cycles?
- This number of zeros cannot occur in any factorial.A068331
This number of zeros cannot occur in any factorial.
- Numbers k such that 2^tau(k) <= k < 2*2^tau(k).A068332
Numbers k such that 2^tau(k) <= k < 2*2^tau(k).
- Product(n/k - k) where the product is over the divisors k of n and where 1 <= k <= sqrt(n).A068333
Product(n/k - k) where the product is over the divisors k of n and where 1 <= k <= sqrt(n).
- a(1) = 1; a(n+1) = 1 + Product_{k|n} a(k), product is over the positive divisors, k, of n.A068334
a(1) = 1; a(n+1) = 1 + Product_{k|n} a(k), product is over the positive divisors, k, of n.
- Numbers k such that 3^tau(k) <= k < 2*3^tau(k).A068335
Numbers k such that 3^tau(k) <= k < 2*3^tau(k).
- a(1) = 1; a(n+1) = 1 + sum{k|n} a(k), sum is over the positive divisors, k, of n.A068336
a(1) = 1; a(n+1) = 1 + sum{k|n} a(k), sum is over the positive divisors, k, of n.
- a(n) = n!*Sum_{k=1..n} mu(k)/k, where mu(k) is the Möbius function.A068337
a(n) = n!*Sum_{k=1..n} mu(k)/k, where mu(k) is the Möbius function.
- a(n) = n!^2 * Sum_{k=1..n} mu(k)/k^2, where mu(k) is the Moebius function.A068338
a(n) = n!^2 * Sum_{k=1..n} mu(k)/k^2, where mu(k) is the Moebius function.
- n!^3 *sum{k=1 to n} mu(k)/k^3, where mu(k) is the Moebius function A008683.A068339
n!^3 *sum{k=1 to n} mu(k)/k^3, where mu(k) is the Moebius function A008683.
- a(n) = Sum_{k=1..n} mu(k)*k, where mu(k) is the Moebius function.A068340
a(n) = Sum_{k=1..n} mu(k)*k, where mu(k) is the Moebius function.
- Sum{k=1 to n} mu(k) mu(n+1-k), where mu(k) is the Moebius function.A068341
Sum{k=1 to n} mu(k) mu(n+1-k), where mu(k) is the Moebius function.
- a(1) = 1; a(n+1) = (product{k|n} a(k)) (sum{j|n} 1/a(j)), where both the product and sum are over the positive divisors of n.A068342
a(1) = 1; a(n+1) = (product{k|n} a(k)) (sum{j|n} 1/a(j)), where both the product and sum are over the positive divisors of n.
- a(n) is a prime power and sum of all prime powers <= a(n) is A025475.A068343
a(n) is a prime power and sum of all prime powers <= a(n) is A025475.
- Square array read by antidiagonals of T(n,k) = sign(n-k).A068344
Square array read by antidiagonals of T(n,k) = sign(n-k).
- Powers of 2, the fourth-from-last digit of which equals 7.A068345
Powers of 2, the fourth-from-last digit of which equals 7.
- a(n) = n'' = second arithmetic derivative of n.A068346
a(n) = n'' = second arithmetic derivative of n.
- Number of partitions of A066925(n) into x_i parts.A068347
Number of partitions of A066925(n) into x_i parts.
- Number of partitions of A066926(n) into x_i parts.A068348
Number of partitions of A066926(n) into x_i parts.
- Numbers k having a partition k=Sum x_i for which Product k/x_i is also a way of factoring k.A068349
Numbers k having a partition k=Sum x_i for which Product k/x_i is also a way of factoring k.
- Numbers n such that n*tau(n) > prime(2*n) where tau(n) = A000005(n).A068350
Numbers n such that n*tau(n) > prime(2*n) where tau(n) = A000005(n).
- Numbers n such that n*tau(n)>prime(3*n) where tau(n)=A000005(n).A068351
Numbers n such that n*tau(n)>prime(3*n) where tau(n)=A000005(n).
- Numbers n such that n*tau(n)>prime(4*n) where tau(n)=A000005(n).A068352
Numbers n such that n*tau(n)>prime(4*n) where tau(n)=A000005(n).
- Decimal expansion of smallest positive root of cos(Pi*x/2)*cosh(Pi*x/2) = -1.A068353
Decimal expansion of smallest positive root of cos(Pi*x/2)*cosh(Pi*x/2) = -1.
- Numbers n such that sigma(n)*tau(n) > prime(2*n) where sigma(n) is the sum of divisors of n and tau(n) the number of divisors of n (A000005).A068354
Numbers n such that sigma(n)*tau(n) > prime(2*n) where sigma(n) is the sum of divisors of n and tau(n) the number of divisors of n (A000005).
- Odd n such that sigma(n)*tau(n)>prime(2*n) where sigma(n) is the sum of divisors of n and tau(n) the number of divisors of n = A000005(n).A068355
Odd n such that sigma(n)*tau(n)>prime(2*n) where sigma(n) is the sum of divisors of n and tau(n) the number of divisors of n = A000005(n).
- Numbers k such that bigomega(k) = tau(prime(k)+1) where tau(k) = A000005(k).A068356
Numbers k such that bigomega(k) = tau(prime(k)+1) where tau(k) = A000005(k).
- Duplicate of A067891.A068357
Duplicate of A067891.
- Numbers k such that the first digit of binomial(2k,k) is 1.A068358
Numbers k such that the first digit of binomial(2k,k) is 1.
- Binomial(2k,k) when the first digit of binomial(2k,k) is 1.A068359
Binomial(2k,k) when the first digit of binomial(2k,k) is 1.
- Numbers n such that there is no squarefree number between prime(n) and prime(n+1).A068360
Numbers n such that there is no squarefree number between prime(n) and prime(n+1).