Sequences
392,541 sequences
- a(n) = Sum_{k=1..n} lcm(n,k)/n.A057661
a(n) = Sum_{k=1..n} lcm(n,k)/n.
- Smallest prime q such that q + 2^prime(n) is a prime, where prime(n) is the n-th prime.A057662
Smallest prime q such that q + 2^prime(n) is a prime, where prime(n) is the n-th prime.
- Primes p such that p + 2^p is also a prime.A057663
Primes p such that p + 2^p is also a prime.
- Primes of the form p + 2^p where p is prime.A057664
Primes of the form p + 2^p where p is prime.
- Numbers k such that prime(k) + 2^prime(k) is prime.A057665
Numbers k such that prime(k) + 2^prime(k) is prime.
- n*(n+1)^2*(n+2)*(n+3)^2*(n+4).A057666
n*(n+1)^2*(n+2)*(n+3)^2*(n+4).
- Primes q of form q = 10p + 3, where p is an odd prime.A057667
Primes q of form q = 10p + 3, where p is an odd prime.
- Number of minimal 7-covers of a labeled n-set.A057668
Number of minimal 7-covers of a labeled n-set.
- Triangle T(n,k) of number of minimal 3-covers of an unlabeled n+3-set that cover k points of that set uniquely (k=3,..,n+3).A057669
Triangle T(n,k) of number of minimal 3-covers of an unlabeled n+3-set that cover k points of that set uniquely (k=3,..,n+3).
- a(n) = Sum_{k|n} lcm(k, n/k).A057670
a(n) = Sum_{k|n} lcm(k, n/k).
- a(n) equals floor(Vc(n) - Vs(n)), where Vc(n) is the volume of the cube with side length n and Vs(n) is the volume of the sphere of diameter n.A057671
a(n) equals floor(Vc(n) - Vs(n)), where Vc(n) is the volume of the cube with side length n and Vs(n) is the volume of the sphere of diameter n.
- a(n) equals floor(As(n) - Ac(n)), where As(n) is the area of the square with side length n and Ac(n) is the area of the circle of diameter n.A057672
a(n) equals floor(As(n) - Ac(n)), where As(n) is the area of the square with side length n and Ac(n) is the area of the circle of diameter n.
- Smallest prime p such that |2^n - p| is a prime.A057673
Smallest prime p such that |2^n - p| is a prime.
- Primes -p+2^n with smallest p prime, arising in A057674.A057674
Primes -p+2^n with smallest p prime, arising in A057674.
- 1 - (5/6)*n + (5/2)*n^2 + (10/3)*n^3 + n^4.A057675
1 - (5/6)*n + (5/2)*n^2 + (10/3)*n^3 + n^4.
- Smallest prime q such that 2^prime(n) - q is prime.A057676
Smallest prime q such that 2^prime(n) - q is prime.
- a(n) is the numerator of b(n) where b(n)=1/b(n-1)+1/b(n-2) with b(1)=1 and b(2)=2.A057677
a(n) is the numerator of b(n) where b(n)=1/b(n-1)+1/b(n-2) with b(1)=1 and b(2)=2.
- Primes of the form 2^p - p where p is prime.A057678
Primes of the form 2^p - p where p is prime.
- Self-locating strings within Pi: numbers n such that the string n is at position n in the decimal digits of Pi, where 3 is the first digit.A057679
Self-locating strings within Pi: numbers n such that the string n is at position n in the decimal digits of Pi, where 3 is the first digit.
- Self-locating strings within Pi: numbers n such that the string n is at position n in the decimal digits of Pi, where the initial digit 3 is at position 0.A057680
Self-locating strings within Pi: numbers n such that the string n is at position n in the decimal digits of Pi, where the initial digit 3 is at position 0.
- a(n) = Sum_{j=0..floor(n/3)} (-1)^j*binomial(n,3*j).A057681
a(n) = Sum_{j=0..floor(n/3)} (-1)^j*binomial(n,3*j).
- a(n) = Sum_{j=0..floor(n/3)} (-1)^j*binomial(n,3*j+1).A057682
a(n) = Sum_{j=0..floor(n/3)} (-1)^j*binomial(n,3*j+1).
- Numbers k such that k^2 + k + 1, k^3 + k + 1 and k^4 + k + 1 are all prime.A057683
Numbers k such that k^2 + k + 1, k^3 + k + 1 and k^4 + k + 1 are all prime.
- Trajectory of 13 under the '13x+1' map.A057684
Trajectory of 13 under the '13x+1' map.
- Trajectory of 19 under the `19x+1' map.A057685
Trajectory of 19 under the `19x+1' map.
- Trajectory of 23 under the `23x+1' map.A057686
Trajectory of 23 under the `23x+1' map.
- Trajectory of 29 under the `29x+1' map.A057687
Trajectory of 29 under the `29x+1' map.
- Trajectory of 5 under the '5x+1' map.A057688
Trajectory of 5 under the '5x+1' map.
- Maximal term in trajectory of P under the 'Px+1' map, where P = n-th prime, or -1 if no such term exists.A057689
Maximal term in trajectory of P under the 'Px+1' map, where P = n-th prime, or -1 if no such term exists.
- Length of cycle in trajectory of P under the 'Px+1' map, where P = n-th prime, or -1 if trajectory does not cycle.A057690
Length of cycle in trajectory of P under the 'Px+1' map, where P = n-th prime, or -1 if trajectory does not cycle.
- Number of terms before entering cycle in trajectory of P under the 'Px+1' map, where P = n-th prime, or -1 if trajectory does not cycle.A057691
Number of terms before entering cycle in trajectory of P under the 'Px+1' map, where P = n-th prime, or -1 if trajectory does not cycle.
- Smallest prime which produces exactly n+1 different primes after n applications of the A048376 transform.A057692
Smallest prime which produces exactly n+1 different primes after n applications of the A048376 transform.
- Number of permutations on n letters that have only cycles of length 3 or less.A057693
Number of permutations on n letters that have only cycles of length 3 or less.
- Chance of holding n-th best poker hand or better is approximately 1/a(n).A057694
Chance of holding n-th best poker hand or better is approximately 1/a(n).
- Number of 5-card poker hands with deuces wild of 5-of-a-kind, royal flush, straight flush, 4-of-a-kind, full house, flush, straight, 3-of-a-kind, two pairs, one pair, no pair.A057695
Number of 5-card poker hands with deuces wild of 5-of-a-kind, royal flush, straight flush, 4-of-a-kind, full house, flush, straight, 3-of-a-kind, two pairs, one pair, no pair.
- Number of letters in n in Brazilian Portuguese (not counting spaces).A057696
Number of letters in n in Brazilian Portuguese (not counting spaces).
- Number of characters in n (including spaces) in Brazilian Portuguese.A057697
Number of characters in n (including spaces) in Brazilian Portuguese.
- Prime lucky numbers k (from A031157) such that nextprime(k)=nextlucky(k).A057698
Prime lucky numbers k (from A031157) such that nextprime(k)=nextlucky(k).
- Primes whose reversal is a cube.A057699
Primes whose reversal is a cube.
- The next new gap between successive lucky numbers.A057700
The next new gap between successive lucky numbers.
- Twin lucky numbers: (n,m) are lucky numbers with |n-m|=2.A057701
Twin lucky numbers: (n,m) are lucky numbers with |n-m|=2.
- Even numbers not the sum of a pair of twin lucky numbers.A057702
Even numbers not the sum of a pair of twin lucky numbers.
- a(n) = n*(94 + 5*n + 25*n^2 - 5*n^3 + n^4)/120.A057703
a(n) = n*(94 + 5*n + 25*n^2 - 5*n^3 + n^4)/120.
- Primorial - 1 prime indices: integers m such that the m-th primorial minus 1 is prime.A057704
Primorial - 1 prime indices: integers m such that the m-th primorial minus 1 is prime.
- Primorial primes: primes p such that p+1 is a primorial number (A002110).A057705
Primorial primes: primes p such that p+1 is a primorial number (A002110).
- Smaller of twin primes whose average is a primorial number.A057706
Smaller of twin primes whose average is a primorial number.
- a(n) is the number of free 'polyominoes' on the (4.8.8) grid with n octagons and n squares.A057707
a(n) is the number of free 'polyominoes' on the (4.8.8) grid with n octagons and n squares.
- Numbers m such that 2^m reversed is prime.A057708
Numbers m such that 2^m reversed is prime.
- Numbers k such that there is a unique m for which the sum of the aliquot parts of m (A001065) is k.A057709
Numbers k such that there is a unique m for which the sum of the aliquot parts of m (A001065) is k.
- Positive integers k with exactly 2 aliquot sequence predecessors. In other words, there are exactly two solutions x for which s(x) = n. The function s(x) here is the sum of all proper divisors of x (A001065).A057710
Positive integers k with exactly 2 aliquot sequence predecessors. In other words, there are exactly two solutions x for which s(x) = n. The function s(x) here is the sum of all proper divisors of x (A001065).