Sequences
392,541 sequences
- C(2n,n)^(2n).A079711
C(2n,n)^(2n).
- Numbers m such that bigomega(m) = 3*omega(m).A079712
Numbers m such that bigomega(m) = 3*omega(m).
- Numbers k such that bigomega(sigma(k)) = sigma(bigomega(k)).A079713
Numbers k such that bigomega(sigma(k)) = sigma(bigomega(k)).
- Number of 2's in n!.A079714
Number of 2's in n!.
- a(n) = pi(n) - pi(sqrt(n)) + 1.A079715
a(n) = pi(n) - pi(sqrt(n)) + 1.
- a(n) = 2*(F(1)^3+F(2)^3+F(3)^3+...+F(p)^3)/(F(1)+F(2)+F(3)+...+F(p)) where p is the n-th prime and F(k) denotes the k-th Fibonacci number.A079716
a(n) = 2*(F(1)^3+F(2)^3+F(3)^3+...+F(p)^3)/(F(1)+F(2)+F(3)+...+F(p)) where p is the n-th prime and F(k) denotes the k-th Fibonacci number.
- Subminimal numbers, from minimal numbers by analogy with subfactorials.A079717
Subminimal numbers, from minimal numbers by analogy with subfactorials.
- Perfect numbers read digit-by-digit.A079718
Perfect numbers read digit-by-digit.
- a(n) = n + floor(Sum_{k<n} a(k)/2) with a(0)=0.A079719
a(n) = n + floor(Sum_{k<n} a(k)/2) with a(0)=0.
- Incorrect duplicate of A062908.A079720
Incorrect duplicate of A062908.
- Interemirp sequence: average of emirp pairs, analogous to interprimes.A079721
Interemirp sequence: average of emirp pairs, analogous to interprimes.
- Triangle of numbers related to an approximation problem connected with Riemann hypothesis.A079722
Triangle of numbers related to an approximation problem connected with Riemann hypothesis.
- Triangle of denominators of numbers related to an approximation problem connected with Riemann hypothesis.A079723
Triangle of denominators of numbers related to an approximation problem connected with Riemann hypothesis.
- Triangle of numerators of numbers related to an approximation problem connected with Riemann hypothesis.A079724
Triangle of numerators of numbers related to an approximation problem connected with Riemann hypothesis.
- Sum of composite numbers less than n-th prime.A079725
Sum of composite numbers less than n-th prime.
- a(1)=1, a(n) is the smallest integer > a(n-1) such that a(n) is even if k(n)=1, a(n) is odd if k(n)=2, where k(n) denotes the n-th term of the Kolakoski sequence (A000002).A079726
a(1)=1, a(n) is the smallest integer > a(n-1) such that a(n) is even if k(n)=1, a(n) is odd if k(n)=2, where k(n) denotes the n-th term of the Kolakoski sequence (A000002).
- a(n) = 1 + C(2,1)^3 + C(4,2)^3 + ... + C(2n,n)^3.A079727
a(n) = 1 + C(2,1)^3 + C(4,2)^3 + ... + C(2n,n)^3.
- sum(k=0,p,binomial(2*k,k)) (mod p) where p runs through the primes.A079728
sum(k=0,p,binomial(2*k,k)) (mod p) where p runs through the primes.
- Kolakoski-(1,2,3) sequence: a(n) is the length of the n-th run.A079729
Kolakoski-(1,2,3) sequence: a(n) is the length of the n-th run.
- Kolakoski variation using (1,2,3,4) starting with 1,2.A079730
Kolakoski variation using (1,2,3,4) starting with 1,2.
- Fundamental piano frequencies in Hertz rounded to nearest integer.A079731
Fundamental piano frequencies in Hertz rounded to nearest integer.
- Primes of the form x^2 + y^2 + 3 (x,y positive).A079732
Primes of the form x^2 + y^2 + 3 (x,y positive).
- Primes of the form x^2 + y^2 + 3 (x,y nonnegative).A079733
Primes of the form x^2 + y^2 + 3 (x,y nonnegative).
- n for which there is a chain (or permutation) of the numbers from 1 to n for which each adjacent pair sums to a Fibonacci number.A079734
n for which there is a chain (or permutation) of the numbers from 1 to n for which each adjacent pair sums to a Fibonacci number.
- Number of positions that are exactly n moves from the starting position in the Hockey Puck puzzle.A079735
Number of positions that are exactly n moves from the starting position in the Hockey Puck puzzle.
- Number of positions that are exactly n moves from the starting position in the Hockey Puck puzzle.A079736
Number of positions that are exactly n moves from the starting position in the Hockey Puck puzzle.
- Number of positions that are exactly n moves from the starting position in the Hockey Puck puzzle.A079737
Number of positions that are exactly n moves from the starting position in the Hockey Puck puzzle.
- Number of positions that are exactly n moves from the starting position in the Hockey Puck puzzle.A079738
Number of positions that are exactly n moves from the starting position in the Hockey Puck puzzle.
- Primes of the form x^2 + y^2 + 2 (x,y nonnegative).A079739
Primes of the form x^2 + y^2 + 2 (x,y nonnegative).
- Primes of the form x^2 + y^2 + 2 (x,y positive).A079740
Primes of the form x^2 + y^2 + 2 (x,y positive).
- Numbers ending with a vowel or the letter y in American English.A079741
Numbers ending with a vowel or the letter y in American English.
- Number of positions that are exactly n moves from the starting position in the Roundy puzzle.A079742
Number of positions that are exactly n moves from the starting position in the Roundy puzzle.
- Number of positions that are exactly n moves from the starting position in the Diamond puzzle.A079743
Number of positions that are exactly n moves from the starting position in the Diamond puzzle.
- Number of positions that are exactly n moves from the starting position in the Pyraminx puzzle.A079744
Number of positions that are exactly n moves from the starting position in the Pyraminx puzzle.
- Number of positions that are exactly n moves from the starting position in the Skewb puzzle.A079745
Number of positions that are exactly n moves from the starting position in the Skewb puzzle.
- Number of positions that are exactly n moves from the starting position in the Halpern-Meier Pyramid puzzle.A079746
Number of positions that are exactly n moves from the starting position in the Halpern-Meier Pyramid puzzle.
- Numbers k such that gpf(k-1) < gpf(k) < gpf(k+1), where gpf(k) is the greatest prime factor of k (A006530).A079747
Numbers k such that gpf(k-1) < gpf(k) < gpf(k+1), where gpf(k) is the greatest prime factor of k (A006530).
- Largest k such that the greatest prime factors from n to n+k are monotonically increasing.A079748
Largest k such that the greatest prime factors from n to n+k are monotonically increasing.
- Erroneous version of A358890.A079749
Erroneous version of A358890.
- Operation count to create all permutations of n distinct elements using the "streamlined" version of Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of comparisons required to find j in step L2.2'.A079750
Operation count to create all permutations of n distinct elements using the "streamlined" version of Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of comparisons required to find j in step L2.2'.
- Operation count to create all permutations of n distinct elements using the "streamlined" version of Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of cases where the j search loop runs beyond j=n-3.A079751
Operation count to create all permutations of n distinct elements using the "streamlined" version of Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of cases where the j search loop runs beyond j=n-3.
- Operation count to create all permutations of n distinct elements using the "streamlined" version of Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of times the search for an element exchangeable with a_j has to be started.A079752
Operation count to create all permutations of n distinct elements using the "streamlined" version of Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of times the search for an element exchangeable with a_j has to be started.
- Operation count to create all permutations of n distinct elements using the "streamlined" version of Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives total executions of step L3.1'.A079753
Operation count to create all permutations of n distinct elements using the "streamlined" version of Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives total executions of step L3.1'.
- Operation count to create all permutations of n distinct elements using the "streamlined" version of Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of times l has to be repeatedly decreased in step L3.1'.A079754
Operation count to create all permutations of n distinct elements using the "streamlined" version of Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of times l has to be repeatedly decreased in step L3.1'.
- Operation count to create all permutations of n distinct elements using the "streamlined" version of Knuth's Algorithm L (lexicographic permutation generation).A079755
Operation count to create all permutations of n distinct elements using the "streamlined" version of Knuth's Algorithm L (lexicographic permutation generation).
- Operation count to create all permutations of n distinct elements using the "streamlined" version of Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of interchanges in reversal step.A079756
Operation count to create all permutations of n distinct elements using the "streamlined" version of Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of interchanges in reversal step.
- Periodic sequence 1, 0, -2, 3, -2, 0, ...A079757
Periodic sequence 1, 0, -2, 3, -2, 0, ...
- Number of positions that are exactly n moves from the starting position in the Ultimate Skewb puzzle.A079758
Number of positions that are exactly n moves from the starting position in the Ultimate Skewb puzzle.
- Let b(0)=0. For n >= 1, b(n) is the least k > b(n-1)+1 such that k divides (k-1)!/b(n-1)!, and a(n) = (b(n)-1)!/(b(n-1)!*b(n)).A079759
Let b(0)=0. For n >= 1, b(n) is the least k > b(n-1)+1 such that k divides (k-1)!/b(n-1)!, and a(n) = (b(n)-1)!/(b(n-1)!*b(n)).
- Denominator in the expression for a(n) in A079759.A079760
Denominator in the expression for a(n) in A079759.