Sequences
392,541 sequences
- Numbers that are not binary cyclic right-rotating progressive sum of digits (see A091821) of any natural number.A091961
Numbers that are not binary cyclic right-rotating progressive sum of digits (see A091821) of any natural number.
- From enumerating paths in the plane.A091962
From enumerating paths in the plane.
- a(n) is the smallest gcd of two interior numbers on row n of Pascal's triangle ("interior" means that the 1's at the ends of the rows are excluded).A091963
a(n) is the smallest gcd of two interior numbers on row n of Pascal's triangle ("interior" means that the 1's at the ends of the rows are excluded).
- Number of left factors of peakless Motzkin paths of length n.A091964
Number of left factors of peakless Motzkin paths of length n.
- Triangle read by rows: T(n,k) = number of lattice paths from (0,0) to (n,k) that do not go below the line y=0 and consist of steps U=(1,1), D=(1,-1) and three types of steps H=(1,0) (left factors of 3-Motzkin steps).A091965
Triangle read by rows: T(n,k) = number of lattice paths from (0,0) to (n,k) that do not go below the line y=0 and consist of steps U=(1,1), D=(1,-1) and three types of steps H=(1,0) (left factors of 3-Motzkin steps).
- Let f(x)=|log x|, f^k(x)=f(f^(k-1)(x))=f iterated k times at x; a(n) = least k such that f^k(n) <= 1/n.A091966
Let f(x)=|log x|, f^k(x)=f(f^(k-1)(x))=f iterated k times at x; a(n) = least k such that f^k(n) <= 1/n.
- a(n) is the n-th term of sequence A_n, ignoring the offset, or -1 if A_n has fewer than n terms.A091967
a(n) is the n-th term of sequence A_n, ignoring the offset, or -1 if A_n has fewer than n terms.
- Primes congruent to 3 (mod 16).A091968
Primes congruent to 3 (mod 16).
- Related to Gray codes: see Comments lines.A091969
Related to Gray codes: see Comments lines.
- a(1) = 0; for n>1, find largest integer k such that the word a(1)a(2)...a(n-1) is of the form xy^k for words x and y (where y has positive length), i.e., k = the maximal number of repeating blocks at the end of the sequence so far; then a(n) = floor(k/2).A091970
a(1) = 0; for n>1, find largest integer k such that the word a(1)a(2)...a(n-1) is of the form xy^k for words x and y (where y has positive length), i.e., k = the maximal number of repeating blocks at the end of the sequence so far; then a(n) = floor(k/2).
- G.f.: (1+x^3)*(1+x^5)*(1+x^6)/((1-x^4)*(1-x^5)*(1-x^6)).A091971
G.f.: (1+x^3)*(1+x^5)*(1+x^6)/((1-x^4)*(1-x^5)*(1-x^6)).
- Expansion of g.f. (1 + x^5 ) / ( (1-x^3)*(1-x^4)).A091972
Expansion of g.f. (1 + x^5 ) / ( (1-x^3)*(1-x^4)).
- Poincaré series [or Poincare series] (or Molien series) for a certain three-dimensional group of order 1344.A091973
Poincaré series [or Poincare series] (or Molien series) for a certain three-dimensional group of order 1344.
- Let R_{k}(n) = the digit reversal of n in base k (R_{k}(n) is written in base 10). a(n) is the number of distinct values of R_{k}(n) arising if k=2,..,n+1.A091974
Let R_{k}(n) = the digit reversal of n in base k (R_{k}(n) is written in base 10). a(n) is the number of distinct values of R_{k}(n) arising if k=2,..,n+1.
- a(1) = 1; for n>1, a(n) = largest integer k such that the word a(1)a(2)...a(n-1) is of is of the form xy^(k_1)Y^(k_2)y^(k_3)Y^(k_4)...y^(k_(m-1))Y^(k_m) where y has positive length and Y=reverse(y) and k_1+k_2+k_3+...+k_m = k.A091975
a(1) = 1; for n>1, a(n) = largest integer k such that the word a(1)a(2)...a(n-1) is of is of the form xy^(k_1)Y^(k_2)y^(k_3)Y^(k_4)...y^(k_(m-1))Y^(k_m) where y has positive length and Y=reverse(y) and k_1+k_2+k_3+...+k_m = k.
- a(1)=1; for n>1, a(n) = largest integer k such that the word a(1)a(2)a(3)...a(n-1) is of the form x(y_1)(y_2)...(y_k) where each y_i is of positive length and any y_i and y_j are related by y_i=P(y_j) for some permutation P.A091976
a(1)=1; for n>1, a(n) = largest integer k such that the word a(1)a(2)a(3)...a(n-1) is of the form x(y_1)(y_2)...(y_k) where each y_i is of positive length and any y_i and y_j are related by y_i=P(y_j) for some permutation P.
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k exterior pairs.A091977
Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k exterior pairs.
- A common Swedish drinking song.A091978
A common Swedish drinking song.
- Number of odd proper distinct prime divisors of n. That is, the number of odd distinct prime divisors of n that are less than n.A091979
Number of odd proper distinct prime divisors of n. That is, the number of odd distinct prime divisors of n that are less than n.
- Recursive sequence; one more than maximum of products of pairs of previous terms with indices summing to current index.A091980
Recursive sequence; one more than maximum of products of pairs of previous terms with indices summing to current index.
- Poincaré series [or Poincare series] (or Molien series) for GL_2(4):2.A091981
Poincaré series [or Poincare series] (or Molien series) for GL_2(4):2.
- Nonprimes n such that Mod(n,4) == 1 and denominator(Fibonacci((n-1)/4)/n) = 1.A091982
Nonprimes n such that Mod(n,4) == 1 and denominator(Fibonacci((n-1)/4)/n) = 1.
- a(0) = 1, a(n) = 20*sigma[3](n).A091983
a(0) = 1, a(n) = 20*sigma[3](n).
- Number of steps required for initial p = 10^n to reach 1 in the recurrence p = floor(Li(p)).A091984
Number of steps required for initial p = 10^n to reach 1 in the recurrence p = floor(Li(p)).
- Number of steps required for the initial value p = 10^n to reach 0 in the recurrence p = pi(p).A091985
Number of steps required for the initial value p = 10^n to reach 0 in the recurrence p = pi(p).
- a(0)=1, a(n) = sigma_3(2n).A091986
a(0)=1, a(n) = sigma_3(2n).
- Number of steps required for initial p = 2^n to reach 0 in the recurrence p = pi(p).A091987
Number of steps required for initial p = 2^n to reach 0 in the recurrence p = pi(p).
- Number of steps required for initial p = 2^n to reach 1 in the recurrence p = floor(Li(p)).A091988
Number of steps required for initial p = 2^n to reach 1 in the recurrence p = floor(Li(p)).
- Numbers that are binary cyclic right-rotating progressive sum of digits (see A091821) of exactly 1 natural number.A091989
Numbers that are binary cyclic right-rotating progressive sum of digits (see A091821) of exactly 1 natural number.
- Number of reduced magic borders of order n (these extend magic squares of order n-2 to order n).A091990
Number of reduced magic borders of order n (these extend magic squares of order n-2 to order n).
- Minimal number of 1's that must be inserted into the binary representation of n to get a prime.A091991
Minimal number of 1's that must be inserted into the binary representation of n to get a prime.
- Numbers n such that 5*n-3 and 5*n+3 are both primes.A091992
Numbers n such that 5*n-3 and 5*n+3 are both primes.
- Numerator of I(n) = Integral_{x=0 to 1/3} (1+x^2)^n dx.A091993
Numerator of I(n) = Integral_{x=0 to 1/3} (1+x^2)^n dx.
- Numerator of I(n) = sqrt(10)*(Integral_{x=0 to 1/3} 1/(1+x^2)^(n+1/2) dx).A091994
Numerator of I(n) = sqrt(10)*(Integral_{x=0 to 1/3} 1/(1+x^2)^(n+1/2) dx).
- Permutation of the natural numbers.A091995
Permutation of the natural numbers.
- Numbers n such that 9*2^(2*n-1) - 1 is prime.A091996
Numbers n such that 9*2^(2*n-1) - 1 is prime.
- Numbers n such that 3*2^(n-1) - 1 is prime.A091997
Numbers n such that 3*2^(n-1) - 1 is prime.
- Numbers that are congruent to {1, 11} mod 12.A091998
Numbers that are congruent to {1, 11} mod 12.
- Numbers that are congruent to {2, 10} mod 12.A091999
Numbers that are congruent to {2, 10} mod 12.
- Numbers that can be expressed as the difference of the squares of primes in exactly four distinct ways.A092000
Numbers that can be expressed as the difference of the squares of primes in exactly four distinct ways.
- Numbers that can be expressed as the difference of the squares of primes in exactly five distinct ways.A092001
Numbers that can be expressed as the difference of the squares of primes in exactly five distinct ways.
- Numbers that can be expressed as the difference of the squares of primes in exactly six distinct ways.A092002
Numbers that can be expressed as the difference of the squares of primes in exactly six distinct ways.
- Numbers that can be expressed as the difference of the squares of primes in exactly seven distinct ways.A092003
Numbers that can be expressed as the difference of the squares of primes in exactly seven distinct ways.
- Numbers that can be expressed as the difference of the squares of primes in exactly eight distinct ways.A092004
Numbers that can be expressed as the difference of the squares of primes in exactly eight distinct ways.
- Numbers that can be expressed as the difference of the squares of primes in exactly nine distinct ways.A092005
Numbers that can be expressed as the difference of the squares of primes in exactly nine distinct ways.
- Numbers that can be expressed as the difference of the squares of primes in exactly ten distinct ways.A092006
Numbers that can be expressed as the difference of the squares of primes in exactly ten distinct ways.
- Numbers that can be expressed as the difference of the squares of primes in exactly eleven distinct ways.A092007
Numbers that can be expressed as the difference of the squares of primes in exactly eleven distinct ways.
- Numbers that can be expressed as the difference of the squares of primes in exactly twelve distinct ways.A092008
Numbers that can be expressed as the difference of the squares of primes in exactly twelve distinct ways.
- Numbers that can be expressed as the difference of the squares of primes in exactly thirteen distinct ways.A092009
Numbers that can be expressed as the difference of the squares of primes in exactly thirteen distinct ways.
- Numbers that can be expressed as the difference of the squares of primes in exactly fourteen distinct ways.A092010
Numbers that can be expressed as the difference of the squares of primes in exactly fourteen distinct ways.