Sequences
392,541 sequences
- Numbers n which occur at least three times in A001600.A090761
Numbers n which occur at least three times in A001600.
- Numbers n which occur exactly 4 times in A001600.A090762
Numbers n which occur exactly 4 times in A001600.
- a(n) = (3*n+3)!/(3*n!*(2*n+2)!).A090763
a(n) = (3*n+3)!/(3*n!*(2*n+2)!).
- Number of partitions of n with two sorts of part 1.A090764
Number of partitions of n with two sorts of part 1.
- Let f(0) = 0, f(1) = 1 and for n > 1 let f(n) = (-1)*sum((-1)^(n+r)*f(r),r=0..n-2)/(n*(n-1)); sequence gives denominator of f(n).A090765
Let f(0) = 0, f(1) = 1 and for n > 1 let f(n) = (-1)*sum((-1)^(n+r)*f(r),r=0..n-2)/(n*(n-1)); sequence gives denominator of f(n).
- Duplicate of A069651.A090766
Duplicate of A069651.
- Numbers of the form 3*x*y*z + 2(x*y + y*z + z*x) + (x + y + z) for x, y, z positive integers.A090767
Numbers of the form 3*x*y*z + 2(x*y + y*z + z*x) + (x + y + z) for x, y, z positive integers.
- a(n) = 4*7^(n^2+2n+1)*Product_{j=1..n} (49^j-1).A090768
a(n) = 4*7^(n^2+2n+1)*Product_{j=1..n} (49^j-1).
- a(n) = 7^(n^2+2n+1)*Product_{j=1..n} (49^j-1).A090769
a(n) = 7^(n^2+2n+1)*Product_{j=1..n} (49^j-1).
- a(n) = 2^(n^2 + 2n + 1)*Product_{j=1..n} (4^j - 1).A090770
a(n) = 2^(n^2 + 2n + 1)*Product_{j=1..n} (4^j - 1).
- Numbers that are congruent to {1, 9} mod 10.A090771
Numbers that are congruent to {1, 9} mod 10.
- Numbers that are congruent to {2, 8} mod 10.A090772
Numbers that are congruent to {2, 8} mod 10.
- Numbers that are congruent to {4, 6} mod 10.A090773
Numbers that are congruent to {4, 6} mod 10.
- A permutation of the natural numbers related to sequence A079946.A090774
A permutation of the natural numbers related to sequence A079946.
- 6*a(n) is the gap between sexy prime triples in the n-th sexy prime triple triple whose initial term is 5.A090775
6*a(n) is the gap between sexy prime triples in the n-th sexy prime triple triple whose initial term is 5.
- 30*a(n) is the gap between sexy prime triples in the n-th sexy prime triple triple whose initial term is 7.A090776
30*a(n) is the gap between sexy prime triples in the n-th sexy prime triple triple whose initial term is 7.
- Numbers k such that sigma(k) divides k^2.A090777
Numbers k such that sigma(k) divides k^2.
- Numbers k such that phi(k) divides k*(k - phi(k)).A090778
Numbers k such that phi(k) divides k*(k - phi(k)).
- Numbers k that divide phi(k)^2.A090779
Numbers k that divide phi(k)^2.
- a(n) = n*Product_{p prime, p|n} (p - 1)/2.A090780
a(n) = n*Product_{p prime, p|n} (p - 1)/2.
- Numbers that can be expressed as the difference of the squares of primes in just one distinct way.A090781
Numbers that can be expressed as the difference of the squares of primes in just one distinct way.
- Numbers that can be expressed as the difference of the squares of primes in just three distinct ways.A090782
Numbers that can be expressed as the difference of the squares of primes in just three distinct ways.
- a(n) can be expressed as the difference of the squares of consecutive primes in just three distinct ways.A090783
a(n) can be expressed as the difference of the squares of consecutive primes in just three distinct ways.
- Numbers that can be expressed as the difference of the squares of consecutive primes in just two distinct ways.A090784
Numbers that can be expressed as the difference of the squares of consecutive primes in just two distinct ways.
- Numbers that can be expressed as the difference of the squares of consecutive primes in just one way.A090785
Numbers that can be expressed as the difference of the squares of consecutive primes in just one way.
- Least nonnegative integer k such that n! + n + k + 1 is prime.A090786
Least nonnegative integer k such that n! + n + k + 1 is prime.
- Number of ways to get n by evaluating 1 (+ or *) 2 (+ or *) 3 ... (+ or *) m for some positive integer m. No parentheses are allowed and the usual order of precedence (* before +) is followed.A090787
Number of ways to get n by evaluating 1 (+ or *) 2 (+ or *) 3 ... (+ or *) m for some positive integer m. No parentheses are allowed and the usual order of precedence (* before +) is followed.
- Numbers that can be expressed as the difference of the squares of primes in just two distinct ways.A090788
Numbers that can be expressed as the difference of the squares of primes in just two distinct ways.
- Even numbers n such that 37^2 (the square of the first irregular prime) divides the numerator of Bernoulli(n).A090789
Even numbers n such that 37^2 (the square of the first irregular prime) divides the numerator of Bernoulli(n).
- Numbers r arising in A090791.A090790
Numbers r arising in A090791.
- Minimal numbers n such that numerator(Bernoulli(2*n)/(2*n)) is different from numerator(Bernoulli(2*n)/(2*n*(2*n-r))) for some integer r.A090791
Minimal numbers n such that numerator(Bernoulli(2*n)/(2*n)) is different from numerator(Bernoulli(2*n)/(2*n*(2*n-r))) for some integer r.
- a(0)=1; for n>0, a(n)=a([n/2])+a([n/4])+a([n/8]).A090792
a(0)=1; for n>0, a(n)=a([n/2])+a([n/4])+a([n/8]).
- Minimal numbers n such that numerator(Bernoulli(2*n)/(2*n)) is different from numerator(Bernoulli(2*n)/(2*n*(2*n-r))) for some integer r and the first m irregular primes including irregularity index > 1.A090793
Minimal numbers n such that numerator(Bernoulli(2*n)/(2*n)) is different from numerator(Bernoulli(2*n)/(2*n*(2*n-r))) for some integer r and the first m irregular primes including irregularity index > 1.
- Number of partitions of n such that the number of different parts is odd.A090794
Number of partitions of n such that the number of different parts is odd.
- a(n) = lesser of a pair of twin primes p, q=p+2 such that product of first n primes plus p is a prime and also product of first n primes plus q is a prime.A090795
a(n) = lesser of a pair of twin primes p, q=p+2 such that product of first n primes plus p is a prime and also product of first n primes plus q is a prime.
- Denominator(Bernoulli(n-1) + 1/n)=30, where n runs through the primes.A090796
Denominator(Bernoulli(n-1) + 1/n)=30, where n runs through the primes.
- Denominator(Bernoulli(n-1) + 1/n)=42, where n runs through the primes.A090797
Denominator(Bernoulli(n-1) + 1/n)=42, where n runs through the primes.
- Irregular primes in the ratio numerator(Bernoulli(2*n)/(2*n)) / numerator(Bernoulli(2*n)/(2*n*(2*n-r))) when these numerators are different and n is a minimum for some integer r. Duplication indicates irregularity index > 1.A090798
Irregular primes in the ratio numerator(Bernoulli(2*n)/(2*n)) / numerator(Bernoulli(2*n)/(2*n*(2*n-r))) when these numerators are different and n is a minimum for some integer r. Duplication indicates irregularity index > 1.
- Denominator(Bernoulli(n-1) + 1/n)=66, where n runs through the primes.A090799
Denominator(Bernoulli(n-1) + 1/n)=66, where n runs through the primes.
- r when numerator(Bernoulli(2*n)/(2*n)) and numerator(Bernoulli(2*n)/(2*n*(2*n-r))) are different and n is minimum for some integer r for the first i irregular primes. These include entries when the irregularity index > 1.A090800
r when numerator(Bernoulli(2*n)/(2*n)) and numerator(Bernoulli(2*n)/(2*n*(2*n-r))) are different and n is minimum for some integer r for the first i irregular primes. These include entries when the irregularity index > 1.
- List of distinct numbers appearing as denominators of Bernoulli numbers.A090801
List of distinct numbers appearing as denominators of Bernoulli numbers.
- Triangle read by rows: a(n,k) = number of k-length walks in the Hasse diagram of a Boolean algebra of order n.A090802
Triangle read by rows: a(n,k) = number of k-length walks in the Hasse diagram of a Boolean algebra of order n.
- a(n) = largest integer m for which "the reduction lemma implies N(p,n;2) = p-n+1 for 2 <= n <= p <= m".A090803
a(n) = largest integer m for which "the reduction lemma implies N(p,n;2) = p-n+1 for 2 <= n <= p <= m".
- Numerators in an asymptotic expansion of Ramanujan.A090804
Numerators in an asymptotic expansion of Ramanujan.
- A simple recurrence with one error.A090805
A simple recurrence with one error.
- Triangular array read by rows: T(n,k) (n >= 2, 1 <= k <= n) = number of partitions of k white balls and n-k black balls in which each part has at least one ball of each color. Also limit of the joint major-index / inversion polynomial for permutations of n elements, as n becomes infinite.A090806
Triangular array read by rows: T(n,k) (n >= 2, 1 <= k <= n) = number of partitions of k white balls and n-k black balls in which each part has at least one ball of each color. Also limit of the joint major-index / inversion polynomial for permutations of n elements, as n becomes infinite.
- First prime in the earliest chain of n consecutive primes with gaps 2^1, 2^2, ..., 2^(n-1).A090807
First prime in the earliest chain of n consecutive primes with gaps 2^1, 2^2, ..., 2^(n-1).
- Numbers m such that the numerator of Sum_{i=1..m} prime(i)/prime(i+1) is prime.A090808
Numbers m such that the numerator of Sum_{i=1..m} prime(i)/prime(i+1) is prime.
- Coefficient of the irreducible character of S_m indexed by (m-2n+2,2n-2) in the n-th Kronecker power of the representation indexed by (m-2,2).A090809
Coefficient of the irreducible character of S_m indexed by (m-2n+2,2n-2) in the n-th Kronecker power of the representation indexed by (m-2,2).
- Distinct numbers appearing as denominators of Bernoulli(2n) for n > 2, divided by 6.A090810
Distinct numbers appearing as denominators of Bernoulli(2n) for n > 2, divided by 6.