Sequences
392,541 sequences
- "Mersenne" semiprimes, semiprimes of the form 2^k-1.A092561
"Mersenne" semiprimes, semiprimes of the form 2^k-1.
- Semiprimes of the form 2^k + 1.A092562
Semiprimes of the form 2^k + 1.
- Coefficients in asymptotic expansion of I_0(x)sqrt(2*Pi*x)/e^x in powers of 1/(16x).A092563
Coefficients in asymptotic expansion of I_0(x)sqrt(2*Pi*x)/e^x in powers of 1/(16x).
- Duplicate of A068811.A092564
Duplicate of A068811.
- Triangle of coefficients T(n,k) (n>=0, 0<=k<=2*n), read by rows, where the n-th row polynomial equals the numerator of the n-th convergent of the continued fraction [1+x+x^2;1+x+x^2,1+x+x^2,...] for n>0, with the zeroth row defined as T(0,0)=1.A092565
Triangle of coefficients T(n,k) (n>=0, 0<=k<=2*n), read by rows, where the n-th row polynomial equals the numerator of the n-th convergent of the continued fraction [1+x+x^2;1+x+x^2,1+x+x^2,...] for n>0, with the zeroth row defined as T(0,0)=1.
- Main diagonal of triangle A092565, in which the n-th row polynomial equals the numerator of the n-th convergent of the continued fraction [1 + x + x^2; 1 + x + x^2, 1 + x + x^2, ...].A092566
Main diagonal of triangle A092565, in which the n-th row polynomial equals the numerator of the n-th convergent of the continued fraction [1 + x + x^2; 1 + x + x^2, 1 + x + x^2, ...].
- Duplicate of A055623.A092567
Duplicate of A055623.
- Duplicate of A055624.A092568
Duplicate of A055624.
- Permutation of integers a(a(n)) = n. In binary representation of n, transformation of inner bits, 1 <-> 0, gives binary representation of a(n).A092569
Permutation of integers a(a(n)) = n. In binary representation of n, transformation of inner bits, 1 <-> 0, gives binary representation of a(n).
- Primes p which become a prime q under transformation of inner bits of binary representation in A092569. In binary representation of p, transformation of inner bits, 1 <-> 0, gives binary representation of q.A092570
Primes p which become a prime q under transformation of inner bits of binary representation in A092569. In binary representation of p, transformation of inner bits, 1 <-> 0, gives binary representation of q.
- Primes of the form 60*R_k + 1, where R_k is the repunit (A002275) of length k.A092571
Primes of the form 60*R_k + 1, where R_k is the repunit (A002275) of length k.
- Numbers of the form x^2 + 3y^2 where x and y are positive integers.A092572
Numbers of the form x^2 + 3y^2 where x and y are positive integers.
- Number of solutions to x^2 + 3y^2 = n in positive integers x and y.A092573
Number of solutions to x^2 + 3y^2 = n in positive integers x and y.
- Positive integers that can be represented in the form x^2 + 3y^2 with (x,y) = 1 and x and y positive.A092574
Positive integers that can be represented in the form x^2 + 3y^2 with (x,y) = 1 and x and y positive.
- Number of representations of n of the form x^2 + 3y^2 with (x,y)=1.A092575
Number of representations of n of the form x^2 + 3y^2 with (x,y)=1.
- a(n) = the least number which is the average of two consecutive primes and has exactly n prime factors (counted with multiplicity).A092576
a(n) = the least number which is the average of two consecutive primes and has exactly n prime factors (counted with multiplicity).
- Decimal expansion of e^(-6).A092577
Decimal expansion of e^(-6).
- Decimal expansion of e^(-7).A092578
Decimal expansion of e^(-7).
- A sieve using the Fibonacci sequence over the integers >=2. Any multiple of a Fibonacci number, F(n)*m, such that F(n)>=2 and m>=2 is excluded and what is left is included.A092579
A sieve using the Fibonacci sequence over the integers >=2. Any multiple of a Fibonacci number, F(n)*m, such that F(n)>=2 and m>=2 is excluded and what is left is included.
- Triangle read by rows: T(n,k) is the number of permutations p of [n] in which exactly the first k terms satisfy the up-down property, i.e., p(1)<p(2), p(2)>p(3), p(3)<p(4), ...A092580
Triangle read by rows: T(n,k) is the number of permutations p of [n] in which exactly the first k terms satisfy the up-down property, i.e., p(1)<p(2), p(2)>p(3), p(3)<p(4), ...
- a(n) is the least prime such that a(n-1) is a quadratic non-residue of a(n).A092581
a(n) is the least prime such that a(n-1) is a quadratic non-residue of a(n).
- Triangle read by rows: T(n,k) is the number of permutations p of [n] having length of first run equal to k.A092582
Triangle read by rows: T(n,k) is the number of permutations p of [n] having length of first run equal to k.
- Triangle read by rows: T(n,k) is the number of permutations p of [n] in which the length of the longest initial segment avoiding the 123-pattern is equal to k.A092583
Triangle read by rows: T(n,k) is the number of permutations p of [n] in which the length of the longest initial segment avoiding the 123-pattern is equal to k.
- Numbers k such that sigma(phi(k)) == phi(sigma(k)) (mod k), that is, A033632(k)/k is an integer.A092584
Numbers k such that sigma(phi(k)) == phi(sigma(k)) (mod k), that is, A033632(k)/k is an integer.
- Numbers k such that sigma(phi(k))-phi(sigma(k)) is nonzero and is divisible by (k-1), that is A065395(k)/(k-1) = (phi(sigma(k))-sigma(phi(k)))/(k-1) is a nonzero integer.A092585
Numbers k such that sigma(phi(k))-phi(sigma(k)) is nonzero and is divisible by (k-1), that is A065395(k)/(k-1) = (phi(sigma(k))-sigma(phi(k)))/(k-1) is a nonzero integer.
- Numbers k such that sigma(phi(k))-phi(sigma(k)) is nonzero and is divisible by (k+1), that is A065395(k)/(k+1) = (phi(sigma(k))-sigma(phi(k)))/(k+1) is a nonzero integer.A092586
Numbers k such that sigma(phi(k))-phi(sigma(k)) is nonzero and is divisible by (k+1), that is A065395(k)/(k+1) = (phi(sigma(k))-sigma(phi(k)))/(k+1) is a nonzero integer.
- Numbers k such that sigma(phi(k))-phi(sigma(k)) is nonzero and divisible by phi(k), that is A065395(k)/A000010(k) is a nonzero integer.A092587
Numbers k such that sigma(phi(k))-phi(sigma(k)) is nonzero and divisible by phi(k), that is A065395(k)/A000010(k) is a nonzero integer.
- Numbers k such that sigma(phi(k)) - phi(sigma(k)) is nonzero and divisible by sigma(k), that is A065395(k)/A000203(k) is a nonzero integer.A092588
Numbers k such that sigma(phi(k)) - phi(sigma(k)) is nonzero and divisible by sigma(k), that is A065395(k)/A000203(k) is a nonzero integer.
- a(n) = -A065395(2^n).A092589
a(n) = -A065395(2^n).
- a(n) = A065395(A000040(n)); values of commutator of sigma and phi function at prime number arguments.A092590
a(n) = A065395(A000040(n)); values of commutator of sigma and phi function at prime number arguments.
- Exponents m such that 1-A065395(2^m) is a power of 2, where A065395(n) = sigma(phi(n)) - phi(sigma(n)).A092591
Exponents m such that 1-A065395(2^m) is a power of 2, where A065395(n) = sigma(phi(n)) - phi(sigma(n)).
- a(n) = A001142(n)/A002944(n), i.e., the product of C(n,j) binomial coefficients (for j=0..n) is divided by the least common multiple of them.A092592
a(n) = A001142(n)/A002944(n), i.e., the product of C(n,j) binomial coefficients (for j=0..n) is divided by the least common multiple of them.
- a(n) is the smallest number k > 1 for which A001142(k)/A002944(k+1)^n is an integer.A092593
a(n) is the smallest number k > 1 for which A001142(k)/A002944(k+1)^n is an integer.
- Triangle read by rows: T(n,k) is the number of permutations p of [n] in which the length of the longest initial segment avoiding both the 132- and the 231-pattern is equal to k.A092594
Triangle read by rows: T(n,k) is the number of permutations p of [n] in which the length of the longest initial segment avoiding both the 132- and the 231-pattern is equal to k.
- Numbers k such that the sum of decimal digits of k and k+1 are both prime numbers, i.e., both k and k+1 are in A028834.A092595
Numbers k such that the sum of decimal digits of k and k+1 are both prime numbers, i.e., both k and k+1 are in A028834.
- Natural numbers n for which sum of decimal digits is greater than n/2.A092596
Natural numbers n for which sum of decimal digits is greater than n/2.
- Natural numbers n for which sum of decimal digits is not smaller than n/3.A092597
Natural numbers n for which sum of decimal digits is not smaller than n/3.
- Natural numbers n for which sum of decimal digits is greater than n/4.A092598
Natural numbers n for which sum of decimal digits is greater than n/4.
- Number of those natural numbers x for which sum of decimal digits exceeds x/n.A092599
Number of those natural numbers x for which sum of decimal digits exceeds x/n.
- Largest natural number x=a[n] for which sum of decimal digits exceeds x/n; for n=1, the case when no such number exists, a[1]=0 was taken arbitrarily.A092600
Largest natural number x=a[n] for which sum of decimal digits exceeds x/n; for n=1, the case when no such number exists, a[1]=0 was taken arbitrarily.
- Number of numbers from 1 to n whose binary representation is contained in that of n!.A092601
Number of numbers from 1 to n whose binary representation is contained in that of n!.
- A093572 with duplicates removed.A092602
A093572 with duplicates removed.
- a(n) = Sum_{k=1..n} min(k!, binomial(n,k)).A092603
a(n) = Sum_{k=1..n} min(k!, binomial(n,k)).
- Complement of A013939.A092604
Complement of A013939.
- Decimal expansion of e^(-1/2) or 1/sqrt(e).A092605
Decimal expansion of e^(-1/2) or 1/sqrt(e).
- Fixed point of the morphism 0 -> 021, 1 -> 0, 2 -> 0; starting with a(1) = 0.A092606
Fixed point of the morphism 0 -> 021, 1 -> 0, 2 -> 0; starting with a(1) = 0.
- Length of longest contiguous block of ones in binary representation of n!.A092607
Length of longest contiguous block of ones in binary representation of n!.
- Number of connected ordered 5-element T_0-antichains on an unlabeled n-set.A092608
Number of connected ordered 5-element T_0-antichains on an unlabeled n-set.
- Product of first n primes that end in 1.A092609
Product of first n primes that end in 1.
- Product of first n primes that end in 3.A092610
Product of first n primes that end in 3.