Sequences
392,541 sequences
- a(n) is the number of occurrences of 7's in the palindromic compositions of 2*n-1, or also, the number of occurrences of 8's in the palindromic compositions of 2*n.A079861
a(n) is the number of occurrences of 7's in the palindromic compositions of 2*n-1, or also, the number of occurrences of 8's in the palindromic compositions of 2*n.
- a(i) = the number of occurrences of 9's in the palindromic compositions of n=2*i-1 = the number of occurrences of 10's in the palindromic compositions of n=2*i.A079862
a(i) = the number of occurrences of 9's in the palindromic compositions of n=2*i-1 = the number of occurrences of 10's in the palindromic compositions of n=2*i.
- a(n) is the number of occurrences of 11s in the palindromic compositions of m=2*n-1 = the number of occurrences of 12s in the palindromic compositions of m=2*n.A079863
a(n) is the number of occurrences of 11s in the palindromic compositions of m=2*n-1 = the number of occurrences of 12s in the palindromic compositions of m=2*n.
- Number of positions that are exactly n moves from the starting position in the Rashkey Type 2 puzzle.A079864
Number of positions that are exactly n moves from the starting position in the Rashkey Type 2 puzzle.
- Number of positions that are exactly n moves from the starting position in the Turn'Push puzzle.A079865
Number of positions that are exactly n moves from the starting position in the Turn'Push puzzle.
- a(1)=1 and for n>1: floor(n^(1/Omega(n))), where Omega(n) is the total number of prime factors of n (A001222).A079866
a(1)=1 and for n>1: floor(n^(1/Omega(n))), where Omega(n) is the total number of prime factors of n (A001222).
- a(1)=1 and for n>1: floor(n^(1/Omega(n)))^Omega(n), where Omega(n) is the total number of prime factors of n (A001222).A079867
a(1)=1 and for n>1: floor(n^(1/Omega(n)))^Omega(n), where Omega(n) is the total number of prime factors of n (A001222).
- a(1)=1 and for n>1: round(n^(1/Omega(n))), where Omega(n) is the total number of prime factors of n (A001222).A079868
a(1)=1 and for n>1: round(n^(1/Omega(n))), where Omega(n) is the total number of prime factors of n (A001222).
- a(1)=1 and for n>1: round(n^(1/Omega(n)))^Omega(n), where Omega(n) is the total number of prime factors of n (A001222).A079869
a(1)=1 and for n>1: round(n^(1/Omega(n)))^Omega(n), where Omega(n) is the total number of prime factors of n (A001222).
- a(1)=1 and for n>1: ceiling(n^(1/Omega(n))), where Omega(n) is the total number of prime factors of n (A001222).A079870
a(1)=1 and for n>1: ceiling(n^(1/Omega(n))), where Omega(n) is the total number of prime factors of n (A001222).
- a(1)=1 and for n>1: ceiling(n^(1/Omega(n)))^Omega(n), where Omega(n) is the total number of prime factors of n (A001222).A079871
a(1)=1 and for n>1: ceiling(n^(1/Omega(n)))^Omega(n), where Omega(n) is the total number of prime factors of n (A001222).
- a(1)=0, a(n) = signum(round(n^(1/Omega(n)))^Omega(n) - n), where Omega(n) is the total number of prime factors of n (A001222).A079872
a(1)=0, a(n) = signum(round(n^(1/Omega(n)))^Omega(n) - n), where Omega(n) is the total number of prime factors of n (A001222).
- Number of positions that are exactly n moves from the starting position in the Classic Lights Out puzzle.A079873
Number of positions that are exactly n moves from the starting position in the Classic Lights Out puzzle.
- Number of configurations in the Classic Lights Out puzzle with n lights on.A079874
Number of configurations in the Classic Lights Out puzzle with n lights on.
- Number of positions that are exactly n moves from the starting position in the Lights Out 2000 puzzle.A079875
Number of positions that are exactly n moves from the starting position in the Lights Out 2000 puzzle.
- Number of positions that are exactly n moves from the starting position in the Lights Out Cube puzzle.A079876
Number of positions that are exactly n moves from the starting position in the Lights Out Cube puzzle.
- Numbers that are divisible by at least one pair of twin primes (A001097).A079877
Numbers that are divisible by at least one pair of twin primes (A001097).
- a(1)=1, then a(n)=2*a(n-1) if 2*a(n-1)<=n, a(n)=2*a(n-1)-n otherwise.A079878
a(1)=1, then a(n)=2*a(n-1) if 2*a(n-1)<=n, a(n)=2*a(n-1)-n otherwise.
- Median prime factor: a(1)=1 and for n>1: least prime p such that not more than floor(Omega(n)/2) prime factors are greater than p; Omega(n) is the total number of prime factors of n (A001222).A079879
Median prime factor: a(1)=1 and for n>1: least prime p such that not more than floor(Omega(n)/2) prime factors are greater than p; Omega(n) is the total number of prime factors of n (A001222).
- a(n) = n/mpf(n), where mpf(n) is the median prime factor of n (A079879).A079880
a(n) = n/mpf(n), where mpf(n) is the median prime factor of n (A079879).
- mpf(n)^Omega(n), where mpf(n) is the median prime factor of n (A079879).A079881
mpf(n)^Omega(n), where mpf(n) is the median prime factor of n (A079879).
- A run of 2^n 1's followed by a run of 2^n 2's, for n=0, 1, 2, ...A079882
A run of 2^n 1's followed by a run of 2^n 2's, for n=0, 1, 2, ...
- a(1) = 1; a(n) = prime(n) - prime(n-1)* a(n-1) if n > 1.A079883
a(1) = 1; a(n) = prime(n) - prime(n-1)* a(n-1) if n > 1.
- Number of comparisons required 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.A079884
Number of comparisons required 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.
- Number of index tests required 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.A079885
Number of index tests required 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.
- Values of x+y where p runs through the primes of form 4k+1 and p=x^2+y^2, 0<=x<=y.A079886
Values of x+y where p runs through the primes of form 4k+1 and p=x^2+y^2, 0<=x<=y.
- Values of y-x where p runs through the primes of form 4k+1 and p=x^2+y^2, 0<=x<=y.A079887
Values of y-x where p runs through the primes of form 4k+1 and p=x^2+y^2, 0<=x<=y.
- Continued fraction expansion of -x, where x is the unique nonzero real solution to Sum_{p prime} x^p = 0.A079888
Continued fraction expansion of -x, where x is the unique nonzero real solution to Sum_{p prime} x^p = 0.
- Primes indexed by A078515; i.e., primes which start record runs of consecutive primes with distinct first differences.A079889
Primes indexed by A078515; i.e., primes which start record runs of consecutive primes with distinct first differences.
- Least number > n having one more prime factor than n, not necessarily distinct.A079890
Least number > n having one more prime factor than n, not necessarily distinct.
- a(n) = gcd(n, A079890(n)).A079891
a(n) = gcd(n, A079890(n)).
- Least number > n having one more distinct prime factor than n.A079892
Least number > n having one more distinct prime factor than n.
- a(n) = gcd(n, A079892(n)), where A079892(n) is the least number > n having one more distinct prime factor than n.A079893
a(n) = gcd(n, A079892(n)), where A079892(n) is the least number > n having one more distinct prime factor than n.
- a(n) = gcd(A079890(n), A079892(n)).A079894
a(n) = gcd(A079890(n), A079892(n)).
- a(1) = 1; a(n) = phi(n) - phi(n-1)* a(n-1) if n > 1.A079895
a(1) = 1; a(n) = phi(n) - phi(n-1)* a(n-1) if n > 1.
- Discriminants of indefinite binary quadratic forms.A079896
Discriminants of indefinite binary quadratic forms.
- a(1) = 1; a(n) = sigma(n) - sigma(n-1)* a(n-1) if n > 1.A079897
a(1) = 1; a(n) = sigma(n) - sigma(n-1)* a(n-1) if n > 1.
- a(1) = 1; a(n) = tau(n) - tau(n-1)* a(n-1) if n > 1.A079898
a(1) = 1; a(n) = tau(n) - tau(n-1)* a(n-1) if n > 1.
- a(1) = 1; a(n) = Fibonacci(n) - Fibonacci(n-1)* a(n-1) if n > 1.A079899
a(1) = 1; a(n) = Fibonacci(n) - Fibonacci(n-1)* a(n-1) if n > 1.
- a(n) = the smallest positive number which furnishes a "one-line proof" for primality of prime(n), the n-th prime; i.e., the smallest k which is relatively prime to p such that k*(p+k) is divisible by every prime less than sqrt(p), where p=prime(n).A079900
a(n) = the smallest positive number which furnishes a "one-line proof" for primality of prime(n), the n-th prime; i.e., the smallest k which is relatively prime to p such that k*(p+k) is divisible by every prime less than sqrt(p), where p=prime(n).
- Triangle of powers, T(n,k) = n^k, 0 <= k <= n, read by rows.A079901
Triangle of powers, T(n,k) = n^k, 0 <= k <= n, read by rows.
- G.f. = { 1+sum(4*n*q^n, n=1..infinity)} / { theta series for square lattice }.A079902
G.f. = { 1+sum(4*n*q^n, n=1..infinity)} / { theta series for square lattice }.
- a(n) = (9n^4 - 18n^3 + 18n^2 - 9n + 2)/2.A079903
a(n) = (9n^4 - 18n^3 + 18n^2 - 9n + 2)/2.
- Triangle read by rows: T(n, k) = n*k, 0 <= k <= n.A079904
Triangle read by rows: T(n, k) = n*k, 0 <= k <= n.
- a(1)=1; then a(n) is smallest positive integer which is consistent with sequence being monotonically increasing and satisfying a(a(n)) = 2n+1 for n>1.A079905
a(1)=1; then a(n) is smallest positive integer which is consistent with sequence being monotonically increasing and satisfying a(a(n)) = 2n+1 for n>1.
- Numbers k such that 5*6^k - 1 is prime.A079906
Numbers k such that 5*6^k - 1 is prime.
- Numbers k such that 11*12^k - 1 is prime.A079907
Numbers k such that 11*12^k - 1 is prime.
- Solution to the Dancing School Problem with 3 girls and n+3 boys: f(3,n).A079908
Solution to the Dancing School Problem with 3 girls and n+3 boys: f(3,n).
- Solution to the Dancing School Problem with 4 girls and n+4 boys: f(4,n).A079909
Solution to the Dancing School Problem with 4 girls and n+4 boys: f(4,n).
- Solution to the Dancing School Problem with 5 girls and n+5 boys: f(5,n).A079910
Solution to the Dancing School Problem with 5 girls and n+5 boys: f(5,n).