Sequences
392,541 sequences
- a(n) = smallest number m such that m*tau(m)/sigma(m) = n, or 0 if no such m exists.A091911
a(n) = smallest number m such that m*tau(m)/sigma(m) = n, or 0 if no such m exists.
- Numerators of Taylor series for log(tan(x)+1/cos(x)).A091912
Numerators of Taylor series for log(tan(x)+1/cos(x)).
- Triangle read by rows: a(n,k) = C(n,k)*(2^(n-k) - 1) for k<n, a(n,k) = 0 for k >= n, where k=0..max(n-1,0).A091913
Triangle read by rows: a(n,k) = C(n,k)*(2^(n-k) - 1) for k<n, a(n,k) = 0 for k >= n, where k=0..max(n-1,0).
- a(n) = 2*a(n-1) + 12*a(n-2).A091914
a(n) = 2*a(n-1) + 12*a(n-2).
- Maximum of even products of partitions of n.A091915
Maximum of even products of partitions of n.
- Maximum of odd products of partitions of n.A091916
Maximum of odd products of partitions of n.
- Coefficient array of polynomials (z-1)^n-1.A091917
Coefficient array of polynomials (z-1)^n-1.
- Inverse of number triangle A091917.A091918
Inverse of number triangle A091917.
- Expansion of 1/((1-2*x)*(1-x^2)^2).A091919
Expansion of 1/((1-2*x)*(1-x^2)^2).
- Smallest n-digit prime with digits from {1,4,7} only, or 0 if no such prime exists.A091920
Smallest n-digit prime with digits from {1,4,7} only, or 0 if no such prime exists.
- Sum of odd proper distinct prime divisors of n. That is, the sum of odd distinct prime divisors of n that are less than n.A091921
Sum of odd proper distinct prime divisors of n. That is, the sum of odd distinct prime divisors of n that are less than n.
- Smallest m such that the decimal representation of the m-th prime interpreted in base n is not a prime, but prime in bases 10 <= b < n.A091922
Smallest m such that the decimal representation of the m-th prime interpreted in base n is not a prime, but prime in bases 10 <= b < n.
- Primes whose decimal representations interpreted in base 11 are not prime.A091923
Primes whose decimal representations interpreted in base 11 are not prime.
- Primes such that their decimal representations interpreted in base 11 are also prime.A091924
Primes such that their decimal representations interpreted in base 11 are also prime.
- Decimal expansion of Pi^3.A091925
Decimal expansion of Pi^3.
- Least k<=n such that A002487(k)=A002487(n).A091926
Least k<=n such that A002487(k)=A002487(n).
- Expansion of (1-6x)/(1-6x-5x^2).A091927
Expansion of (1-6x)/(1-6x-5x^2).
- a(0)=1, a(1)=5; a(n) = 6*a(n-1) + 5*a(n-2) for n > 1.A091928
a(0)=1, a(1)=5; a(n) = 6*a(n-1) + 5*a(n-2) for n > 1.
- Expansion of (1-6x)/(1-6x-11x^2).A091929
Expansion of (1-6x)/(1-6x-11x^2).
- Write Pi = Sum_{n>=1} 1/sqrt(a(n)), where each a(n) is minimal and unique and the sum approaches Pi from below.A091930
Write Pi = Sum_{n>=1} 1/sqrt(a(n)), where each a(n) is minimal and unique and the sum approaches Pi from below.
- Change the first bit to 0 in binary notation for the n-th prime.A091931
Change the first bit to 0 in binary notation for the n-th prime.
- Primes that remain prime when their leading digit in binary representation is replaced by 0.A091932
Primes that remain prime when their leading digit in binary representation is replaced by 0.
- Decimal expansion of e^3.A091933
Decimal expansion of e^3.
- Number of dual isomorphisms on [ n,n* ].A091934
Number of dual isomorphisms on [ n,n* ].
- Smallest number of 1's in binary representations of primes between 2^n and 2^(n+1).A091935
Smallest number of 1's in binary representations of primes between 2^n and 2^(n+1).
- Smallest prime between 2^n and 2^(n+1), having a minimal number of 1's in binary representation.A091936
Smallest prime between 2^n and 2^(n+1), having a minimal number of 1's in binary representation.
- Greatest number of 1's in binary representations of primes between 2^n and 2^(n+1).A091937
Greatest number of 1's in binary representations of primes between 2^n and 2^(n+1).
- Smallest prime between 2^n and 2^(n+1), having a maximal number of 1's in binary representation.A091938
Smallest prime between 2^n and 2^(n+1), having a maximal number of 1's in binary representation.
- Prime numbers with prime sum of any two digits.A091939
Prime numbers with prime sum of any two digits.
- Given n colors, sequence gives number of ways to color the vertices of a square such that no edge has the same color on both of its vertices.A091940
Given n colors, sequence gives number of ways to color the vertices of a square such that no edge has the same color on both of its vertices.
- a(n) equals the least k that produces the maximum number of partial quotients in the simple continued fraction expansion of (1/n + 1/k).A091941
a(n) equals the least k that produces the maximum number of partial quotients in the simple continued fraction expansion of (1/n + 1/k).
- a(n) equals the maximum number of partial quotients in the simple continued fraction expansion of (1/n + 1/k) for k>=1.A091942
a(n) equals the maximum number of partial quotients in the simple continued fraction expansion of (1/n + 1/k) for k>=1.
- Triangle, read by rows, where T(n,k) equals the least m>0 that produces the maximum number of partial quotients in the simple continued fraction expansion of (1/n + 1/k + 1/m).A091943
Triangle, read by rows, where T(n,k) equals the least m>0 that produces the maximum number of partial quotients in the simple continued fraction expansion of (1/n + 1/k + 1/m).
- Triangle, read by rows, where T(n,k) equals the maximum number of partial quotients in the simple continued fraction expansion of (1/n + 1/k + 1/m) for m>=1.A091944
Triangle, read by rows, where T(n,k) equals the maximum number of partial quotients in the simple continued fraction expansion of (1/n + 1/k + 1/m) for m>=1.
- Numbers n such that there is no k, 0 <= k < n, satisfying A002487(k) = A002487(n).A091945
Numbers n such that there is no k, 0 <= k < n, satisfying A002487(k) = A002487(n).
- a(n) = floor(11^n/10^n).A091946
a(n) = floor(11^n/10^n).
- (Fractional part of 1.1^n) * 10^n.A091947
(Fractional part of 1.1^n) * 10^n.
- Number of values of k, 0 <= k <= n, satisfying A002487(k) = A002487(n).A091948
Number of values of k, 0 <= k <= n, satisfying A002487(k) = A002487(n).
- a(n) = A087659(n) mod 2.A091949
a(n) = A087659(n) mod 2.
- a(n) = A087659(n) mod 3.A091950
a(n) = A087659(n) mod 3.
- Let R_{k}(m) = the digit reversal of m in base k (R_{k}(m) is written in base 10). a(n) is the smallest m such that R_{k}(m) = n, where k >= 2.A091951
Let R_{k}(m) = the digit reversal of m in base k (R_{k}(m) is written in base 10). a(n) is the smallest m such that R_{k}(m) = n, where k >= 2.
- a(1)=1, a(2n)=(a(n)+1) mod 2; a(2n+1)=2*a(2n).A091952
a(1)=1, a(2n)=(a(n)+1) mod 2; a(2n+1)=2*a(2n).
- a(1)=1, a(2n)=1+a(n)(mod 2); a(2n+1)=2*a(2n)+1.A091953
a(1)=1, a(2n)=1+a(n)(mod 2); a(2n+1)=2*a(2n)+1.
- Number of odd proper divisors of n. That is, the number of odd divisors of n that are less than n.A091954
Number of odd proper divisors of n. That is, the number of odd divisors of n that are less than n.
- Number of increasing subsequences that can be made from the sequence of successive numbers.A091955
Number of increasing subsequences that can be made from the sequence of successive numbers.
- Number of increasing subsequences that can be made from the sequence of successive primes.A091956
Number of increasing subsequences that can be made from the sequence of successive primes.
- a(1)=0, a(2)=1, a(n)=A000217(a(n-1)) + A000217(a(n-2)).A091957
a(1)=0, a(2)=1, a(n)=A000217(a(n-1)) + A000217(a(n-2)).
- Triangle read by rows: T(n,k)=number of ordered trees with n edges and k branch nodes at odd height.A091958
Triangle read by rows: T(n,k)=number of ordered trees with n edges and k branch nodes at odd height.
- a(1)=1, a(2n)=(a(n)+1) mod 2, a(2n+1)=2*a(2n)+1.A091959
a(1)=1, a(2n)=(a(n)+1) mod 2, a(2n+1)=2*a(2n)+1.
- a(1)=1, a(2n)=a(2n-1)+(a(n)mod 2), a(2n+1)=a(2n)+1.A091960
a(1)=1, a(2n)=a(2n-1)+(a(n)mod 2), a(2n+1)=a(2n)+1.