Sequences
392,541 sequences
- Number of partitions of n into distinct parts such that number of parts is even.A067661
Number of partitions of n into distinct parts such that number of parts is even.
- Numbers n such that n^2 + 1 and n^4 + 1 are primes.A067662
Numbers n such that n^2 + 1 and n^4 + 1 are primes.
- Sequence gives values of gcd(k!+1, k^k-1) when not equal to 1 in order of appearance.A067663
Sequence gives values of gcd(k!+1, k^k-1) when not equal to 1 in order of appearance.
- Numbers n such that n^2 + 1 and n^2 + n + 1 are primes.A067664
Numbers n such that n^2 + 1 and n^2 + n + 1 are primes.
- The start of a record-setting run of consecutive integers i with distinct A001222(i).A067665
The start of a record-setting run of consecutive integers i with distinct A001222(i).
- Sum of squares of prime factors of n (counted with multiplicity).A067666
Sum of squares of prime factors of n (counted with multiplicity).
- a(n) = (2^n)!/2^(2^n-1).A067667
a(n) = (2^n)!/2^(2^n-1).
- a(n)=(3^n)!/3^(floor(3^n/2)).A067668
a(n)=(3^n)!/3^(floor(3^n/2)).
- a(n)=(5^n)!/5^(floor(5^n/4)).A067669
a(n)=(5^n)!/5^(floor(5^n/4)).
- Smallest prime of additive persistence n.A067670
Smallest prime of additive persistence n.
- The prime factors of n are also prime factors of the decimal encoding (A067599) of the prime factorization of n.A067671
The prime factors of n are also prime factors of the decimal encoding (A067599) of the prime factorization of n.
- Numbers k such that floor((3/2)^(k+2))/floor((3/2)^k) = (3/2)^2.A067672
Numbers k such that floor((3/2)^(k+2))/floor((3/2)^k) = (3/2)^2.
- Numbers k such that floor((3/2)^(k+3))/floor((3/2)^k) = (3/2)^3.A067673
Numbers k such that floor((3/2)^(k+3))/floor((3/2)^k) = (3/2)^3.
- Numbers k such that floor((3/2)^(k+4))/floor((3/2)^k)=(3/2)^4.A067674
Numbers k such that floor((3/2)^(k+4))/floor((3/2)^k)=(3/2)^4.
- Number of fixed convex polyominoes with n cells.A067675
Number of fixed convex polyominoes with n cells.
- Number of fixed directed convex polyominoes with n cells.A067676
Number of fixed directed convex polyominoes with n cells.
- Diagonals of the prime-composite array, B(m,n) which are zeros from the Second Borve Conjecture.A067677
Diagonals of the prime-composite array, B(m,n) which are zeros from the Second Borve Conjecture.
- Numbers m such that sigma(4*m+3) = 6*m.A067678
Numbers m such that sigma(4*m+3) = 6*m.
- Numbers m such that sigma(4m+5) = 6m.A067679
Numbers m such that sigma(4m+5) = 6m.
- Numbers k such that sigma(2k + 2) = 4k.A067680
Numbers k such that sigma(2k + 2) = 4k.
- Diagonals and antidiagonals of the prime-composite array, B(m,n) which are zeros from the Third Borve Conjecture.A067681
Diagonals and antidiagonals of the prime-composite array, B(m,n) which are zeros from the Third Borve Conjecture.
- Floor((11/10)^n) is prime.A067682
Floor((11/10)^n) is prime.
- Numbers k such that phi(k)*sigma(k) + 1 is prime.A067683
Numbers k such that phi(k)*sigma(k) + 1 is prime.
- Numbers n such that sigma(2n+1)=3n.A067684
Numbers n such that sigma(2n+1)=3n.
- Numbers n such that sigma(4n+1)=6n.A067685
Numbers n such that sigma(4n+1)=6n.
- a(n) = a(n-1) * a(n-1) - B * a(n-1) + B, a(0) = 1 + B for B = 7.A067686
a(n) = a(n-1) * a(n-1) - B * a(n-1) + B, a(0) = 1 + B for B = 7.
- Expansion of 1/( 1 - x / Product_{n>=1} (1-x^n) ).A067687
Expansion of 1/( 1 - x / Product_{n>=1} (1-x^n) ).
- Composite numbers that are equal to the sum of the r-th powers of its prime factors (counted with multiplicity) for some integer r.A067688
Composite numbers that are equal to the sum of the r-th powers of its prime factors (counted with multiplicity) for some integer r.
- Inverse of determinant of n X n matrix whose (i,j)-th element is 1/(i+j).A067689
Inverse of determinant of n X n matrix whose (i,j)-th element is 1/(i+j).
- gcd((2n)!+1, n!+1) when not equal to 1.A067690
gcd((2n)!+1, n!+1) when not equal to 1.
- a(n) = (a(n-1) + 1)^(n-1) for n > 0, a(0) = 0.A067691
a(n) = (a(n-1) + 1)^(n-1) for n > 0, a(0) = 0.
- a(n) = Sum_{0 < d <= t <= n, d|n, t|n} d*t.A067692
a(n) = Sum_{0 < d <= t <= n, d|n, t|n} d*t.
- Minimum length of the self-conjugates partitions of n (0 if n=2; length of a partition is the number of parts).A067693
Minimum length of the self-conjugates partitions of n (0 if n=2; length of a partition is the number of parts).
- Minimum number of distinct parts in a self-conjugate partition of n, or 0 if n=2.A067694
Minimum number of distinct parts in a self-conjugate partition of n, or 0 if n=2.
- Smallest prime factor with minimum exponent in canonical prime factorization of n, a(1)=1.A067695
Smallest prime factor with minimum exponent in canonical prime factorization of n, a(1)=1.
- Numbers k such that prime(k) == -1 (mod sigma(k)).A067696
Numbers k such that prime(k) == -1 (mod sigma(k)).
- Numbers k such that prime(k) == 1 (mod sigma(k)).A067697
Numbers k such that prime(k) == 1 (mod sigma(k)).
- Positive integers such that sigma(n) >= exp(gamma) * n * log(log(n)).A067698
Positive integers such that sigma(n) >= exp(gamma) * n * log(log(n)).
- Number of comparisons made in a version of the sorting algorithm QuickSort for an array of size n with n identical elements.A067699
Number of comparisons made in a version of the sorting algorithm QuickSort for an array of size n with n identical elements.
- a(n) = 2*(n^2)!*Product_{k=0..n-1} k!/(n+k)!.A067700
a(n) = 2*(n^2)!*Product_{k=0..n-1} k!/(n+k)!.
- Numbers n such that phi(n-1) + phi(n+1) = phi(2n).A067701
Numbers n such that phi(n-1) + phi(n+1) = phi(2n).
- Numbers k such that sigma(k) == 0 (mod k+2).A067702
Numbers k such that sigma(k) == 0 (mod k+2).
- Terms in the decimal expansion of 1/(7*5^n) before the block of decimals 142857 (the period of 1/7) appears.A067703
Terms in the decimal expansion of 1/(7*5^n) before the block of decimals 142857 (the period of 1/7) appears.
- Numbers n such that phi(sigma(n)) = 2*phi(n).A067704
Numbers n such that phi(sigma(n)) = 2*phi(n).
- a(n) = 11*n^2 + 22*n.A067705
a(n) = 11*n^2 + 22*n.
- Numbers k such that phi(sigma(k)) = 3*phi(k).A067706
Numbers k such that phi(sigma(k)) = 3*phi(k).
- a(n) = 3*n^2 + 12*n.A067707
a(n) = 3*n^2 + 12*n.
- Numbers n such that phi(sigma(n)) = 5*phi(n).A067708
Numbers n such that phi(sigma(n)) = 5*phi(n).
- Numbers k such that phi(2*sigma(k)) = 2*sigma(phi(k)).A067709
Numbers k such that phi(2*sigma(k)) = 2*sigma(phi(k)).
- a(n) = n! * Sum_{k|n} (Sum_{j=1..k} 1/j); the k-sum is over the positive divisors, k, of n.A067710
a(n) = n! * Sum_{k|n} (Sum_{j=1..k} 1/j); the k-sum is over the positive divisors, k, of n.