Sequences
392,541 sequences
- Number of partitions of n of order n.A074761
Number of partitions of n of order n.
- Fifth root of n contains n as a string of digits to the immediate right of the decimal point (excluding leading zeros).A074762
Fifth root of n contains n as a string of digits to the immediate right of the decimal point (excluding leading zeros).
- a(n) = (1/n) * Sum_{d divides n} (-1)^(n+d)*phi(n/d)*2^d.A074763
a(n) = (1/n) * Sum_{d divides n} (-1)^(n+d)*phi(n/d)*2^d.
- Numbers of smaller squares into which a square may be dissected.A074764
Numbers of smaller squares into which a square may be dissected.
- Number of composites that are a concatenation nk of n and k for values of k from 1 to n.A074765
Number of composites that are a concatenation nk of n and k for values of k from 1 to n.
- a(n) = prime(2n) - 2*prime(n) - n.A074766
a(n) = prime(2n) - 2*prime(n) - n.
- Least m > n with spf(m) = gpf(n), where gpf(n) is the greatest prime factor of n and spf(m) is the smallest prime factor of m.A074767
Least m > n with spf(m) = gpf(n), where gpf(n) is the greatest prime factor of n and spf(m) is the smallest prime factor of m.
- Related to series for Laplace limit constant.A074768
Related to series for Laplace limit constant.
- Least k such that the number of steps to reach 1 starting with k and iterating the Collatz process equals k/n, or -1 if no such k exists.A074769
Least k such that the number of steps to reach 1 starting with k and iterating the Collatz process equals k/n, or -1 if no such k exists.
- Numbers n such that tau(n) > tau(n+1), phi(n) > phi(n+1) and sigma(n) > sigma(n+1).A074770
Numbers n such that tau(n) > tau(n+1), phi(n) > phi(n+1) and sigma(n) > sigma(n+1).
- Numbers k such that tau(k) < tau(k+1), phi(k) < phi(k+1) and sigma(k) < sigma(k+1).A074771
Numbers k such that tau(k) < tau(k+1), phi(k) < phi(k+1) and sigma(k) < sigma(k+1).
- Numbers k such that tau(k) < tau(k+1) and phi(k) < phi(k+1).A074772
Numbers k such that tau(k) < tau(k+1) and phi(k) < phi(k+1).
- Strong pseudoprimes to bases 2, 3, 5 and 7.A074773
Strong pseudoprimes to bases 2, 3, 5 and 7.
- a(n) = A005148(n)/8^(b(n)-1) where b(n) denotes the number of 1's in the binary representation of n.A074774
a(n) = A005148(n)/8^(b(n)-1) where b(n) denotes the number of 1's in the binary representation of n.
- Numbers n such that tau(n) < tau(n+1) where tau(x)=A000005(x).A074775
Numbers n such that tau(n) < tau(n+1) where tau(x)=A000005(x).
- Numbers k such that 2^k-1 and F(k) are not relatively prime, where F(k) denotes the k-th Fibonacci number.A074776
Numbers k such that 2^k-1 and F(k) are not relatively prime, where F(k) denotes the k-th Fibonacci number.
- Integers n such that sigma(phi(n))/n = 1/2.A074777
Integers n such that sigma(phi(n))/n = 1/2.
- Numbers k such that 2^k+1 and F(k) are not relatively prime, where F(k) denotes the k-th Fibonacci number.A074778
Numbers k such that 2^k+1 and F(k) are not relatively prime, where F(k) denotes the k-th Fibonacci number.
- Numbers k such that 2^k+1 and F(k) are relatively prime, where F(k) denotes the k-th Fibonacci number.A074779
Numbers k such that 2^k+1 and F(k) are relatively prime, where F(k) denotes the k-th Fibonacci number.
- Numbers k such that 2^k-1 and F(k) are relatively prime, where F(k) denotes the k-th Fibonacci number.A074780
Numbers k such that 2^k-1 and F(k) are relatively prime, where F(k) denotes the k-th Fibonacci number.
- Primes of the form p*2^k + 1 for any k and any prime p.A074781
Primes of the form p*2^k + 1 for any k and any prime p.
- Let b(1)=b(2)=1, b(k) = (2^b(k-1)+2^b(k-2)) (mod k); sequence gives values of n such that b(n)=0.A074782
Let b(1)=b(2)=1, b(k) = (2^b(k-1)+2^b(k-2)) (mod k); sequence gives values of n such that b(n)=0.
- a(n) = floor(1/sin(x(n))) where x(n) is Pi truncated at the n-th decimal digit.A074783
a(n) = floor(1/sin(x(n))) where x(n) is Pi truncated at the n-th decimal digit.
- a(n) = a(n-1) + square of the sum of digits of n.A074784
a(n) = a(n-1) + square of the sum of digits of n.
- Decimal expansion of -log(log(2)).A074785
Decimal expansion of -log(log(2)).
- Numbers k such that phi(k) = Sum_{d|k} core(d) where core(x) is the squarefree part of x (A007913).A074786
Numbers k such that phi(k) = Sum_{d|k} core(d) where core(x) is the squarefree part of x (A007913).
- Sum of squares of the number of unitary divisors of k from 1 to n.A074787
Sum of squares of the number of unitary divisors of k from 1 to n.
- Prime numbers in the Perrin sequence b(n+1) = b(n-1) + b(n-2) with initial values b(1)=3, b(2)=0, b(3)=2.A074788
Prime numbers in the Perrin sequence b(n+1) = b(n-1) + b(n-2) with initial values b(1)=3, b(2)=0, b(3)=2.
- Partial sums of usigma(n)^2: square of the sum of unitary divisors of n.A074789
Partial sums of usigma(n)^2: square of the sum of unitary divisors of n.
- a(n) = (2*n+1)!*Sum_{k=0..n} (-1)^k/(2*k+1)!.A074790
a(n) = (2*n+1)!*Sum_{k=0..n} (-1)^k/(2*k+1)!.
- Numbers k such that k does not divide the denominator of the k-th harmonic number.A074791
Numbers k such that k does not divide the denominator of the k-th harmonic number.
- Least k > 1 such that k^n == 1 (mod n).A074792
Least k > 1 such that k^n == 1 (mod n).
- Sum of prime powers less than or equal to n.A074793
Sum of prime powers less than or equal to n.
- Number of numbers k <= n such that tau(k) == 1 (mod 3) where tau(k) = A000005(k) is the number of divisors of k.A074794
Number of numbers k <= n such that tau(k) == 1 (mod 3) where tau(k) = A000005(k) is the number of divisors of k.
- Number of numbers k <= n such that tau(k) == 0 (mod 3) where tau(k) = A000005(k) is the number of divisors of k.A074795
Number of numbers k <= n such that tau(k) == 0 (mod 3) where tau(k) = A000005(k) is the number of divisors of k.
- Number of numbers k <= n such that tau(k) == 2 (mod 3) where tau(k) = A000005(k) is the number of divisors of k.A074796
Number of numbers k <= n such that tau(k) == 2 (mod 3) where tau(k) = A000005(k) is the number of divisors of k.
- a(n) = A000081(n+1) - 2*A000081(n).A074797
a(n) = A000081(n+1) - 2*A000081(n).
- Floor of S*n^2, where S equals sum of reciprocal terms of this same sequence.A074798
Floor of S*n^2, where S equals sum of reciprocal terms of this same sequence.
- a(n) = numerator( (4*n+1)*(Product_{i=1..n} (2*i-1)/Product_{i=1..n} 2*i)^5 ).A074799
a(n) = numerator( (4*n+1)*(Product_{i=1..n} (2*i-1)/Product_{i=1..n} 2*i)^5 ).
- a(n) = denominator( (4*n+1)*(Product_{i=1..n} (2*i-1)/Product_{i=1..n} (2*i))^5 ).A074800
a(n) = denominator( (4*n+1)*(Product_{i=1..n} (2*i-1)/Product_{i=1..n} (2*i))^5 ).
- a(n) is the sum of the n-th row of the triangle formed by replacing each m in Pascal's triangle with sigma(m).A074801
a(n) is the sum of the n-th row of the triangle formed by replacing each m in Pascal's triangle with sigma(m).
- Number of numbers k <= n such that tau(k) = tau(k+1) where tau(x) = A000005(x) is the number of divisors of x.A074802
Number of numbers k <= n such that tau(k) = tau(k+1) where tau(x) = A000005(x) is the number of divisors of x.
- Kolakoski-(4,2) sequence: a(n) is length of n-th run.A074803
Kolakoski-(4,2) sequence: a(n) is length of n-th run.
- Kolakoski-(3,2) sequence: a(n) is length of n-th run.A074804
Kolakoski-(3,2) sequence: a(n) is length of n-th run.
- n mod 19 + 1 ("Golden Number").A074805
n mod 19 + 1 ("Golden Number").
- Least k such that F(k) reduced (mod prime(n)) = prime(n)-1 where F(k) is the k-th Fibonacci number.A074806
Least k such that F(k) reduced (mod prime(n)) = prime(n)-1 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 + POD(n) + 1, otherwise 2n - POD(n) - 1, where POD(n) is the product of the digits of n; or -1 if no prime is ever reached.A074807
Number of steps needed to reach a prime when the following map is repeatedly applied to n: if n is even then 2n + POD(n) + 1, otherwise 2n - POD(n) - 1, where POD(n) is the product of the digits of n; or -1 if no prime is ever reached.
- Let f(n) be 2n + POD(n) + 1 if n is even, otherwise 2n - POD(n) - 1, where POD(n) is the product of digits of n. Sequence gives smallest number requiring n iterations to reach a prime.A074808
Let f(n) be 2n + POD(n) + 1 if n is even, otherwise 2n - POD(n) - 1, where POD(n) is the product of digits of n. Sequence gives smallest number requiring n iterations to reach a prime.
- Largest prime factor of A019518, concatenation of first n primes.A074809
Largest prime factor of A019518, concatenation of first n primes.
- Numbers k such that the number of primes between k and 2k (inclusive) = largest prime factor of k.A074810
Numbers k such that the number of primes between k and 2k (inclusive) = largest prime factor of k.