Sequences
392,541 sequences
- Moebius function applied to A000461.A074711
Moebius function applied to A000461.
- Number of (interiors of) cells touched by a diagonal in a regular n X k grid (enumerated antidiagonally).A074712
Number of (interiors of) cells touched by a diagonal in a regular n X k grid (enumerated antidiagonally).
- Numbers n such that the sum of the anti-divisors of n = phi(n).A074713
Numbers n such that the sum of the anti-divisors of n = phi(n).
- Primes that divide Fibonacci number F(2^k) for some k.A074714
Primes that divide Fibonacci number F(2^k) for some k.
- Number of prime factors of F(2^n) where F(m) is the m-th Fibonacci number.A074715
Number of prime factors of F(2^n) where F(m) is the m-th Fibonacci number.
- Numbers k such that 2^k - F(k) is prime, where F(n) is the n-th Fibonacci number.A074716
Numbers k such that 2^k - F(k) is prime, where F(n) is the n-th Fibonacci number.
- Least k such that floor(2^n/k) is prime.A074717
Least k such that floor(2^n/k) is prime.
- Least k such that floor(3^n/k) is prime.A074718
Least k such that floor(3^n/k) is prime.
- ip(n): the number of primes not exceeding reverse(n).A074719
ip(n): the number of primes not exceeding reverse(n).
- Least k such that floor(3^n/2^k) is prime.A074720
Least k such that floor(3^n/2^k) is prime.
- Concatenate the primes as 2357111317192329313..., then insert commas from left to right so that between each pair of successive commas is a prime, always making the new prime as small as possible.A074721
Concatenate the primes as 2357111317192329313..., then insert commas from left to right so that between each pair of successive commas is a prime, always making the new prime as small as possible.
- a(n) = Sum_{d divides n} phi(n/d)*(-1)^bigomega(d).A074722
a(n) = Sum_{d divides n} phi(n/d)*(-1)^bigomega(d).
- Largest power of 2 dividing F(3n) where F(k) is the k-th Fibonacci number.A074723
Largest power of 2 dividing F(3n) where F(k) is the k-th Fibonacci number.
- Highest power of 3 dividing F(4n) where F(k) is the k-th Fibonacci number.A074724
Highest power of 3 dividing F(4n) where F(k) is the k-th Fibonacci number.
- Numbers k such that F(k) and C(2k,k) are relatively prime, where F(k) is the k-th Fibonacci number (A000045(k)).A074725
Numbers k such that F(k) and C(2k,k) are relatively prime, where F(k) is the k-th Fibonacci number (A000045(k)).
- Numbers k such that sigma(F(k)) > 2*F(k) where F(k) is the k-th Fibonacci number.A074726
Numbers k such that sigma(F(k)) > 2*F(k) where F(k) is the k-th Fibonacci number.
- Number of steps needed to reach a prime when the following map is repeatedly applied to n: if n is even then 2n + SOD(n) + 1, otherwise 2n - SOD(n) - 1, where SOD(n) is the sum of the digits of n; or -1 if no prime is ever reached.A074727
Number of steps needed to reach a prime when the following map is repeatedly applied to n: if n is even then 2n + SOD(n) + 1, otherwise 2n - SOD(n) - 1, where SOD(n) is the sum of the digits of n; or -1 if no prime is ever reached.
- a(n) = Sum_{k=1..n} k^(n-k)*binomial(n,k-1).A074728
a(n) = Sum_{k=1..n} k^(n-k)*binomial(n,k-1).
- Numbers whose sum of anti-divisors is a square.A074729
Numbers whose sum of anti-divisors is a square.
- Squares whose sum of anti-divisors is a square.A074730
Squares whose sum of anti-divisors is a square.
- Squares whose sum of anti-divisors is a cube.A074731
Squares whose sum of anti-divisors is a cube.
- a(n+3) = floor( ( a(n) + 2*a(n+1) + 3*a(n+2) )/4 ), with a(0), a(1), a(2) equal to 0, 1, 2.A074732
a(n+3) = floor( ( a(n) + 2*a(n+1) + 3*a(n+2) )/4 ), with a(0), a(1), a(2) equal to 0, 1, 2.
- a(n+4) = floor( ( a(n) + 2*a(n+1) + 3*a(n+2) + 4*a(n+3) )/5 ), with a(0), a(1), a(2), a(3) equal to 0, 1, 2, 3.A074733
a(n+4) = floor( ( a(n) + 2*a(n+1) + 3*a(n+2) + 4*a(n+3) )/5 ), with a(0), a(1), a(2), a(3) equal to 0, 1, 2, 3.
- Triangle read by rows where T(n,k) = count of differences between standard sort and 'modular sort' over all subsets of k integers chosen from n. Modular sort considers the integers 1..n to lie on a circle and rotates them to exclude the largest interval.A074734
Triangle read by rows where T(n,k) = count of differences between standard sort and 'modular sort' over all subsets of k integers chosen from n. Modular sort considers the integers 1..n to lie on a circle and rotates them to exclude the largest interval.
- Number of steps to reach an integer starting with (n+3)/4 and iterating the map x -> x*ceiling(x).A074735
Number of steps to reach an integer starting with (n+3)/4 and iterating the map x -> x*ceiling(x).
- Goedel encoding of the prime factors of n, in increasing order and repeated according to multiplicity.A074736
Goedel encoding of the prime factors of n, in increasing order and repeated according to multiplicity.
- Let b(1)=b(2)=1, b(k+2)=gcd(k!,b(k+1)+b(k)); sequence gives values of k such that b(k)=1.A074737
Let b(1)=b(2)=1, b(k+2)=gcd(k!,b(k+1)+b(k)); sequence gives values of k such that b(k)=1.
- Decimal expansion of 1-(1+log(log(2)))/log(2).A074738
Decimal expansion of 1-(1+log(log(2)))/log(2).
- Numbers n such that omega(n) > log(log(n)).A074739
Numbers n such that omega(n) > log(log(n)).
- a(n) = n!*2^(n-1)/Product_{k=1..n} tau(k) where tau = A000005.A074740
a(n) = n!*2^(n-1)/Product_{k=1..n} tau(k) where tau = A000005.
- Sum of squares of gaps between consecutive primes.A074741
Sum of squares of gaps between consecutive primes.
- a(n) = (n^3 + 6n^2 - n + 12)/6.A074742
a(n) = (n^3 + 6n^2 - n + 12)/6.
- Smallest k such that trinomial x^A001153(n) + x^k + 1 over GF(2) is primitive.A074743
Smallest k such that trinomial x^A001153(n) + x^k + 1 over GF(2) is primitive.
- Values of k corresponding to A073726.A074744
Values of k corresponding to A073726.
- a(n) = sum_{k=1..n} prime(k)*prime(k+1).A074745
a(n) = sum_{k=1..n} prime(k)*prime(k+1).
- Number of distinct differences between consecutive anti-divisors of n (ordered by size).A074746
Number of distinct differences between consecutive anti-divisors of n (ordered by size).
- Largest difference between consecutive anti-divisors of n (ordered by size).A074747
Largest difference between consecutive anti-divisors of n (ordered by size).
- Numbers for which the differences between consecutive anti-divisors (ordered by size) are not distinct.A074748
Numbers for which the differences between consecutive anti-divisors (ordered by size) are not distinct.
- Smallest difference between consecutive anti-divisors of n (ordered by size).A074749
Smallest difference between consecutive anti-divisors of n (ordered by size).
- Numbers k such that (largest prime dividing k) = (number of anti-divisors of k).A074750
Numbers k such that (largest prime dividing k) = (number of anti-divisors of k).
- Numbers k such that the sum of the anti-divisors of k = sum of proper divisors (or aliquot parts) of k.A074751
Numbers k such that the sum of the anti-divisors of k = sum of proper divisors (or aliquot parts) of k.
- Number of combinatorially inequivalent cyclic subgroups of S_n of order 6. Number of partitions of n of order 6.A074752
Number of combinatorially inequivalent cyclic subgroups of S_n of order 6. Number of partitions of n of order 6.
- Number of integers k such that sigma(k) < n.A074753
Number of integers k such that sigma(k) < n.
- Number of integers k such that sigma(k) divides n.A074754
Number of integers k such that sigma(k) divides n.
- Number of n-digit non-leading-zero trimorphic numbers (m such that m^3 ends in m).A074755
Number of n-digit non-leading-zero trimorphic numbers (m such that m^3 ends in m).
- Least s > n such that tau(n!) divides tau(s!).A074756
Least s > n such that tau(n!) divides tau(s!).
- Numbers n such that tau(n) = (tau(n+1)+tau(n-1))/2.A074757
Numbers n such that tau(n) = (tau(n+1)+tau(n-1))/2.
- Decimal expansion of zeta'(1/2)/zeta(1/2).A074758
Decimal expansion of zeta'(1/2)/zeta(1/2).
- Number of degree-n permutations of order dividing n. Number of solutions to x^n = 1 in S_n.A074759
Number of degree-n permutations of order dividing n. Number of solutions to x^n = 1 in S_n.
- Decimal expansion of lambda(1) in Li's criterion.A074760
Decimal expansion of lambda(1) in Li's criterion.