Sequences
392,541 sequences
- Denominator of Sum_{k=1..n} phi(k)/k^4.A072161
Denominator of Sum_{k=1..n} phi(k)/k^4.
- (Prime(n)+prime(n+1)+prime(n+2))/(n+1) is an integer; sequence gives prime(n).A072162
(Prime(n)+prime(n+1)+prime(n+2))/(n+1) is an integer; sequence gives prime(n).
- a(n)-th factorial is the smallest factorial containing exactly n 2's, or 0 if no such number exists.A072163
a(n)-th factorial is the smallest factorial containing exactly n 2's, or 0 if no such number exists.
- Numbers k >= 1 such that f(k) = k^k - (k-1)^(k-1) is prime.A072164
Numbers k >= 1 such that f(k) = k^k - (k-1)^(k-1) is prime.
- Values of Moebius function of the products of two (not necessarily distinct) primes (semiprimes or 2-almost primes, A001358).A072165
Values of Moebius function of the products of two (not necessarily distinct) primes (semiprimes or 2-almost primes, A001358).
- Triangle in which first row is {1}; to get n-th row take first n numbers greater than last number in previous row which are congruent to 1 (mod n).A072166
Triangle in which first row is {1}; to get n-th row take first n numbers greater than last number in previous row which are congruent to 1 (mod n).
- T_10(n) in the notation of Bergeron et al., u_10(n) in the notation of Gessel: Related to Young tableaux of bounded height.A072167
T_10(n) in the notation of Bergeron et al., u_10(n) in the notation of Gessel: Related to Young tableaux of bounded height.
- Floor of ratio of volume of n-dimensional cube of side 2 to volume of n-dimensional ball of radius 1.A072168
Floor of ratio of volume of n-dimensional cube of side 2 to volume of n-dimensional ball of radius 1.
- Commuting permutations: number of ordered triples of permutations f, g, h in Symm(n) which all commute.A072169
Commuting permutations: number of ordered triples of permutations f, g, h in Symm(n) which all commute.
- Square array T(n,k) (n >= 0, k >= 2) read by antidiagonals, where T(n,k) is the number of ways of writing n as Sum_{i>=0} c_i 2^i, c_i in {0,1,...,k-1}.A072170
Square array T(n,k) (n >= 0, k >= 2) read by antidiagonals, where T(n,k) is the number of ways of writing n as Sum_{i>=0} c_i 2^i, c_i in {0,1,...,k-1}.
- Number of stars of visual magnitude n.A072171
Number of stars of visual magnitude n.
- a(n) = (2*n+1)*5^(2*n+1).A072172
a(n) = (2*n+1)*5^(2*n+1).
- a(n) = (2*n+1)*239^(2*n+1).A072173
a(n) = (2*n+1)*239^(2*n+1).
- Maximum path length of a crippled knight on an n X n board.A072174
Maximum path length of a crippled knight on an n X n board.
- a(1)=1, a(2)=2, a(n) = a(n-1) + 1 - 2*sign(a(n-2)) for n>2.A072175
a(1)=1, a(2)=2, a(n) = a(n-1) + 1 - 2*sign(a(n-2)) for n>2.
- Unimodal analog of Fibonacci numbers: a(n+1) = Sum_{k=0..floor(n/2)} A071922(n-k,k).A072176
Unimodal analog of Fibonacci numbers: a(n+1) = Sum_{k=0..floor(n/2)} A071922(n-k,k).
- a(n)-th factorial is the smallest factorial containing exactly n 3's, or 0 if no such number exists.A072177
a(n)-th factorial is the smallest factorial containing exactly n 3's, or 0 if no such number exists.
- a(n)-th factorial is the smallest factorial containing exactly n 4's, or 0 if no such number exists.A072178
a(n)-th factorial is the smallest factorial containing exactly n 4's, or 0 if no such number exists.
- Numbers n such that n^(n+1) - (n+1)^n is prime.A072179
Numbers n such that n^(n+1) - (n+1)^n is prime.
- Numbers k such that 2^k - k^2 is prime.A072180
Numbers k such that 2^k - k^2 is prime.
- a(1) = 1; for n >= 2, suppose a(n-1) = Product p_i^e_i and n = Product p_i^f_i, then a(n) = Product p_i^(e_i*f_i).A072181
a(1) = 1; for n >= 2, suppose a(n-1) = Product p_i^e_i and n = Product p_i^f_i, then a(n) = Product p_i^(e_i*f_i).
- A Wallis pair (x,y) satisfies sigma(x^2) = sigma(y^2); sequence gives x's for Wallis pairs with x < y (ordered by values of x, then y).A072182
A Wallis pair (x,y) satisfies sigma(x^2) = sigma(y^2); sequence gives x's for Wallis pairs with x < y (ordered by values of x, then y).
- Sequence arising from factorization of the Fibonacci numbers.A072183
Sequence arising from factorization of the Fibonacci numbers.
- Complement of A072676.A072184
Complement of A072676.
- Primes p = x1x2x3...xn in base 10 such that x1^p1 + x2^p2 + x3^p3 + ... + xn^pn is a prime, where pn is the n-th prime.A072185
Primes p = x1x2x3...xn in base 10 such that x1^p1 + x2^p2 + x3^p3 + ... + xn^pn is a prime, where pn is the n-th prime.
- A Wallis pair (x,y) satisfies sigma(x^2) = sigma(y^2); sequence gives y's for Wallis pairs with x < y (ordered by values of x).A072186
A Wallis pair (x,y) satisfies sigma(x^2) = sigma(y^2); sequence gives y's for Wallis pairs with x < y (ordered by values of x).
- Number of up-down involutions of length n.A072187
Number of up-down involutions of length n.
- Numbers k that divide sigma(k-1)+sigma(k)+sigma(k+1), where sigma() is the "sum of integer divisors" function.A072188
Numbers k that divide sigma(k-1)+sigma(k)+sigma(k+1), where sigma() is the "sum of integer divisors" function.
- Weight distribution of [103,52,19] binary quadratic-residue (or QR) code.A072189
Weight distribution of [103,52,19] binary quadratic-residue (or QR) code.
- Indices of primes with primitive root 2.A072190
Indices of primes with primitive root 2.
- a(n) = a(n-1)^2 + 2.A072191
a(n) = a(n-1)^2 + 2.
- Indices of Sophie Germain primes: p and 2p+1 are primes.A072192
Indices of Sophie Germain primes: p and 2p+1 are primes.
- Concatenate continued fraction expansions of the rational numbers 1/2, 1/3, 2/3, 1/4, 2/4, 3/4, 1/5, 2/5, ...A072193
Concatenate continued fraction expansions of the rational numbers 1/2, 1/3, 2/3, 1/4, 2/4, 3/4, 1/5, 2/5, ...
- Replace all prime factors p of n with n-p.A072194
Replace all prime factors p of n with n-p.
- Replace all prime factors p of n with n/p.A072195
Replace all prime factors p of n with n/p.
- Multiples of 3 which on one operation of the Collatz function T (N -> 3N+1/2^r) yield the number 5.A072196
Multiples of 3 which on one operation of the Collatz function T (N -> 3N+1/2^r) yield the number 5.
- a(n) = 4*a(n-1) + 1 with a(0) = 3.A072197
a(n) = 4*a(n-1) + 1 with a(0) = 3.
- E12 range of preferred resistor values in electronic engineering.A072198
E12 range of preferred resistor values in electronic engineering.
- a(n)-th factorial is the smallest factorial containing exactly n 5's, or 0 if no such number exists.A072199
a(n)-th factorial is the smallest factorial containing exactly n 5's, or 0 if no such number exists.
- a(n)-th factorial is the smallest factorial containing exactly n 6's, or 0 if no such number exists.A072200
a(n)-th factorial is the smallest factorial containing exactly n 6's, or 0 if no such number exists.
- a(n) = 4*a(n-1) + 1, a(1) = 15.A072201
a(n) = 4*a(n-1) + 1, a(1) = 15.
- Same numbers of prime factors of forms 4*k+1 and 4*k+3, counted with multiplicity.A072202
Same numbers of prime factors of forms 4*k+1 and 4*k+3, counted with multiplicity.
- (Number of oddly factored numbers <= n) - (number of evenly factored numbers <= n).A072203
(Number of oddly factored numbers <= n) - (number of evenly factored numbers <= n).
- a(n) is the smallest integer k whose factorial contains exactly n 7's, or 0 if no such number exists.A072204
a(n) is the smallest integer k whose factorial contains exactly n 7's, or 0 if no such number exists.
- a(n) = (p^2 - p + 2)/2 for p = prime(n); number of squares modulo p^2.A072205
a(n) = (p^2 - p + 2)/2 for p = prime(n); number of squares modulo p^2.
- Third terms of triple Peano sequence A071988.A072206
Third terms of triple Peano sequence A071988.
- a(0) = 1; for n>0, a(n) = number of distinct sums of subsets of {1, 1/2, 1/3, 1/4, ..., 1/n} (allowing the empty subset).A072207
a(0) = 1; for n>0, a(n) = number of distinct sums of subsets of {1, 1/2, 1/3, 1/4, ..., 1/n} (allowing the empty subset).
- a(n)-th factorial is the smallest factorial containing exactly n 8's, or 0 if no such number exists.A072208
a(n)-th factorial is the smallest factorial containing exactly n 8's, or 0 if no such number exists.
- Number of primitive roots of those integers with at least one primitive root.A072209
Number of primitive roots of those integers with at least one primitive root.
- a(1)=a(2)=1; a(n)=reverse(reverse(a(n-1))+reverse(a(n-2))) for n > 2.A072210
a(1)=a(2)=1; a(n)=reverse(reverse(a(n-1))+reverse(a(n-2))) for n > 2.