Sequences
392,541 sequences
- a(n) = Pell(4n) / Pell(4).A091761
a(n) = Pell(4n) / Pell(4).
- Last n digits of concatenation of first n primes.A091762
Last n digits of concatenation of first n primes.
- Primes in A091762.A091763
Primes in A091762.
- Triangle of coefficients of n-th degree interpolating polynomial to sqrt(x) multiplied by 4^n.A091764
Triangle of coefficients of n-th degree interpolating polynomial to sqrt(x) multiplied by 4^n.
- Numbers n such that A007306(n) divides n.A091765
Numbers n such that A007306(n) divides n.
- For n > 2, let m be the least number that cannot be expressed as a(i), a(i)+a(j), or a(i)-a(j) with i, j < n. Then a(n) = a(n-1)+m.A091766
For n > 2, let m be the least number that cannot be expressed as a(i), a(i)+a(j), or a(i)-a(j) with i, j < n. Then a(n) = a(n-1)+m.
- a(n) is the largest number such that all numbers from 1 to a(n) can be expressed using first n terms of A091766.A091767
a(n) is the largest number such that all numbers from 1 to a(n) can be expressed using first n terms of A091766.
- Similar to Bell numbers (A000110).A091768
Similar to Bell numbers (A000110).
- Poincaré series [or Poincare series] (or Molien series) for a certain six-fold wreath product P_6.A091769
Poincaré series [or Poincare series] (or Molien series) for a certain six-fold wreath product P_6.
- Poincaré series [or Poincare series] (or Molien series) for H^*(GL_4(F_2)).A091770
Poincaré series [or Poincare series] (or Molien series) for H^*(GL_4(F_2)).
- a(0) = 2; for n > 0, a(n) is the least prime of the form k*n*a(n-1) + 1.A091771
a(0) = 2; for n > 0, a(n) is the least prime of the form k*n*a(n-1) + 1.
- a(n) = gcd(A000108(n), A000110(n)).A091772
a(n) = gcd(A000108(n), A000110(n)).
- G.f.: Product((1+x^i)/(1-x^i),i=1..n-1)/(1-x^n), with n = 5.A091773
G.f.: Product((1+x^i)/(1-x^i),i=1..n-1)/(1-x^n), with n = 5.
- Expansion of g.f. Product((1+x^i)/(1-x^i),i=1..n-1)/(1-x^n), with n = 6.A091774
Expansion of g.f. Product((1+x^i)/(1-x^i),i=1..n-1)/(1-x^n), with n = 6.
- 1 + 4^n + 9^n + 16^n.A091775
1 + 4^n + 9^n + 16^n.
- a(1)= 1, a(n+1) = a(n)*(a(n)+1)*(a(n)+2)*...*(a(n)+n-1)/n.A091776
a(1)= 1, a(n+1) = a(n)*(a(n)+1)*(a(n)+2)*...*(a(n)+n-1)/n.
- Product of the numbers from (n-1)^2+1 to n^2.A091777
Product of the numbers from (n-1)^2+1 to n^2.
- Expansion of g.f. Product((1+x^i)/(1-x^i),i=1..n-1)/(1-x^n), with n = 7.A091778
Expansion of g.f. Product((1+x^i)/(1-x^i),i=1..n-1)/(1-x^n), with n = 7.
- G.f.: Product((1+x^i)/(1-x^i),i=1..n-1)/(1-x^n), with n = 8.A091779
G.f.: Product((1+x^i)/(1-x^i),i=1..n-1)/(1-x^n), with n = 8.
- Alternately odd and even numbers such that a(n) is the least number not included earlier and has a common factor with a(n-1).A091780
Alternately odd and even numbers such that a(n) is the least number not included earlier and has a common factor with a(n-1).
- Beginning with 1, sum of all possible strings obtained as concatenation of previous (successive) terms.A091781
Beginning with 1, sum of all possible strings obtained as concatenation of previous (successive) terms.
- a(1) = 1, a(2) = 1, a(3) = a(1) + concatenation a(1), a(2). In general a(n) = a(1) + a(1)a(2)+ a(1)a(2)a(3) + ... + a(1)a(2)...a(n-1), where a(1)a(2)...a(r) is the concatenation of first r terms.A091782
a(1) = 1, a(2) = 1, a(3) = a(1) + concatenation a(1), a(2). In general a(n) = a(1) + a(1)a(2)+ a(1)a(2)a(3) + ... + a(1)a(2)...a(n-1), where a(1)a(2)...a(r) is the concatenation of first r terms.
- Numbers with digits in nondecreasing order such that sum of the reciprocals of the digits is 1.A091783
Numbers with digits in nondecreasing order such that sum of the reciprocals of the digits is 1.
- Numbers n with digits in nondecreasing order such that sum of the reciprocal of digits is an integer.A091784
Numbers n with digits in nondecreasing order such that sum of the reciprocal of digits is an integer.
- Evil numbers (see A001969) in A003159.A091785
Evil numbers (see A001969) in A003159.
- Number of electoral votes per state in the U.S.A. (for 2001-2010).A091786
Number of electoral votes per state in the U.S.A. (for 2001-2010).
- a(1) = 2. To get a(n+1), write the string a(1)a(2)...a(n) as xy^k for words x and y (where y has positive length) and k is maximized, i.e., k = the maximal number of repeating blocks at the end of the sequence so far. Then a(n+1) = max(k,2).A091787
a(1) = 2. To get a(n+1), write the string a(1)a(2)...a(n) as xy^k for words x and y (where y has positive length) and k is maximized, i.e., k = the maximal number of repeating blocks at the end of the sequence so far. Then a(n+1) = max(k,2).
- a(1) = 1, a(2) = 2 and a(n) = product of the nonzero digits of all previous terms.A091788
a(1) = 1, a(2) = 2 and a(n) = product of the nonzero digits of all previous terms.
- a(1) = 1, a(2) = 2, a(n) = reverse concatenation of two previous terms.A091789
a(1) = 1, a(2) = 2, a(n) = reverse concatenation of two previous terms.
- Palindromes obtained as the concatenation of three successive terms of A091789.A091790
Palindromes obtained as the concatenation of three successive terms of A091789.
- Least multiple of n such that the n-th partial concatenation is a multiple of the n-th odd number (i.e., 2n-1).A091791
Least multiple of n such that the n-th partial concatenation is a multiple of the n-th odd number (i.e., 2n-1).
- Concatenation of first n terms of A091791 divided by (2n-1).A091792
Concatenation of first n terms of A091791 divided by (2n-1).
- Triangle read by rows in which row n contains the smallest nontrivial set of n consecutive numbers divisible by the next n numbers respectively. The next n numbers are numbers from n(n-1)/2 +1 up to n(n+1)/2.A091793
Triangle read by rows in which row n contains the smallest nontrivial set of n consecutive numbers divisible by the next n numbers respectively. The next n numbers are numbers from n(n-1)/2 +1 up to n(n+1)/2.
- First column of A091793.A091794
First column of A091793.
- Diagonal of A091793.A091795
Diagonal of A091793.
- Smallest k such that for 0 <= i < n, n*(n+1)/2-i divides k+i.A091796
Smallest k such that for 0 <= i < n, n*(n+1)/2-i divides k+i.
- Smallest k such that for 0 <= i < n, 1+i+n*(n-1)/2 divides k-i.A091797
Smallest k such that for 0 <= i < n, 1+i+n*(n-1)/2 divides k-i.
- Duplicate of A070198.A091798
Duplicate of A070198.
- a(1) = 3. To get a(n+1), write the string a(1)a(2)...a(n) as xy^k for words x and y (where y has positive length) and k is maximized, i.e., k = the maximal number of repeating blocks at the end of the sequence so far. Then a(n+1) = max(k,3).A091799
a(1) = 3. To get a(n+1), write the string a(1)a(2)...a(n) as xy^k for words x and y (where y has positive length) and k is maximized, i.e., k = the maximal number of repeating blocks at the end of the sequence so far. Then a(n+1) = max(k,3).
- Largest n-digit number with maximal number of distinct prime divisors.A091800
Largest n-digit number with maximal number of distinct prime divisors.
- Largest n-digit multiple of the n-th prime.A091801
Largest n-digit multiple of the n-th prime.
- 10^n - (largest n-digit multiple of the n-th prime).A091802
10^n - (largest n-digit multiple of the n-th prime).
- (Smallest n-digit multiple of the n-th prime) - 10^(n-1).A091803
(Smallest n-digit multiple of the n-th prime) - 10^(n-1).
- a(n) = 2^(n*(n+1)/2)*A055209(n).A091804
a(n) = 2^(n*(n+1)/2)*A055209(n).
- Smallest prime beginning with the concatenation of the next n numbers.A091805
Smallest prime beginning with the concatenation of the next n numbers.
- Given the infinite continued fraction i+(i/(i+(i/(i+...)))), where i is the square root of (-1), this is the numerator of the real part of the convergents.A091806
Given the infinite continued fraction i+(i/(i+(i/(i+...)))), where i is the square root of (-1), this is the numerator of the real part of the convergents.
- Given the infinite continued fraction i+(i/(i+(i/(i+...)))), where i is the square root of (-1), this is the denominator of the real part of the convergents.A091807
Given the infinite continued fraction i+(i/(i+(i/(i+...)))), where i is the square root of (-1), this is the denominator of the real part of the convergents.
- Given the infinite continued fraction i+(i/(i+(i/(i+...)))), where i is the square root of (-1), this is the numerator of the imaginary part of the convergents.A091808
Given the infinite continued fraction i+(i/(i+(i/(i+...)))), where i is the square root of (-1), this is the numerator of the imaginary part of the convergents.
- Given the infinite continued fraction i+(i/(i+(i/(i+...)))), where i is the square root of (-1), this is the denominator of the imaginary part of the convergents.A091809
Given the infinite continued fraction i+(i/(i+(i/(i+...)))), where i is the square root of (-1), this is the denominator of the imaginary part of the convergents.
- Hankel transform of the sequence A001469 (unsigned), Genocchi numbers of first kind.A091810
Hankel transform of the sequence A001469 (unsigned), Genocchi numbers of first kind.