Sequences
392,541 sequences
- Numbers with a square number of 1's in their binary expansion.A084561
Numbers with a square number of 1's in their binary expansion.
- Even numbers having no more than two partitions into two odd primes.A084562
Even numbers having no more than two partitions into two odd primes.
- Even numbers having no more than three partitions into two odd primes.A084563
Even numbers having no more than three partitions into two odd primes.
- Even numbers having no more than four partitions into two odd primes.A084564
Even numbers having no more than four partitions into two odd primes.
- Number of connected switching classes of signed graphs with n nodes.A084565
Number of connected switching classes of signed graphs with n nodes.
- a(0)=1, a(2n) = 2a(2n-1)+a(n), a(2n+1) = 2a(2n)+2a(n).A084566
a(0)=1, a(2n) = 2a(2n-1)+a(n), a(2n+1) = 2a(2n)+2a(n).
- Binomial transform of (1,-1,4,-16,64,-256,1024,...) = (3*0^n-(-4)^n)/4.A084567
Binomial transform of (1,-1,4,-16,64,-256,1024,...) = (3*0^n-(-4)^n)/4.
- a(0)=1, a(1)=5, a(n+2)=4a(n), n>0.A084568
a(0)=1, a(1)=5, a(n+2)=4a(n), n>0.
- Partial sums of A084570.A084569
Partial sums of A084570.
- Partial sums of A084263.A084570
Partial sums of A084263.
- Let a(1)=1; for n>1, a(n)=nextprime((3/2)*a(n-1)).A084571
Let a(1)=1; for n>1, a(n)=nextprime((3/2)*a(n-1)).
- Let a(1)=1; for n>1, a(n)=nextprime((Pi/2)*a(n-1)).A084572
Let a(1)=1; for n>1, a(n)=nextprime((Pi/2)*a(n-1)).
- Let a(1)=1; for n>1, a(n)=nextprime( a(n-1)^(n/(n-1)) ).A084573
Let a(1)=1; for n>1, a(n)=nextprime( a(n-1)^(n/(n-1)) ).
- Continued fraction expansion of e^(1/e).A084574
Continued fraction expansion of e^(1/e).
- Number of terms in polynomial expression for determinant of generic circulant matrix of order n.A084575
Number of terms in polynomial expression for determinant of generic circulant matrix of order n.
- Let y = m/GK(k), where m and k vary over the positive integers and GK(k)=log(1+1/(k*(k+2)))/log(2) is the Gauss-Kuzmin distribution of k. Sort the y values by size and number them consecutively by n. This sequence gives the values of n when m=1.A084576
Let y = m/GK(k), where m and k vary over the positive integers and GK(k)=log(1+1/(k*(k+2)))/log(2) is the Gauss-Kuzmin distribution of k. Sort the y values by size and number them consecutively by n. This sequence gives the values of n when m=1.
- Let y = m/GK(k), where m and k vary over the positive integers and GK(k)=log(1+1/(k*(k+2)))/log(2) is the Gauss-Kuzmin distribution of k. Sort the y values by size and number them consecutively by n. This sequence gives the values of floor(y) in order by n.A084577
Let y = m/GK(k), where m and k vary over the positive integers and GK(k)=log(1+1/(k*(k+2)))/log(2) is the Gauss-Kuzmin distribution of k. Sort the y values by size and number them consecutively by n. This sequence gives the values of floor(y) in order by n.
- Positive integers not found in A084577.A084578
Positive integers not found in A084577.
- Let y = m/GK(k), where m and k vary over the positive integers and GK(k)=log(1+1/(k*(k+2)))/log(2) is the Gauss-Kuzmin distribution of k. Sort the y values by size and number them consecutively by n. This sequence gives the values of m in order by n.A084579
Let y = m/GK(k), where m and k vary over the positive integers and GK(k)=log(1+1/(k*(k+2)))/log(2) is the Gauss-Kuzmin distribution of k. Sort the y values by size and number them consecutively by n. This sequence gives the values of m in order by n.
- Let y = m/GK(k), where m and k vary over the positive integers and GK(k)=log(1+1/(k*(k+2)))/log(2) is the Gauss-Kuzmin distribution of k. Sort the y values by size and number them consecutively by n. This sequence gives the values of k in order by n.A084580
Let y = m/GK(k), where m and k vary over the positive integers and GK(k)=log(1+1/(k*(k+2)))/log(2) is the Gauss-Kuzmin distribution of k. Sort the y values by size and number them consecutively by n. This sequence gives the values of k in order by n.
- Let y = m/GK(k), where m and k vary over the positive integers and GK(k)=log(1+1/(k*(k+2)))/log(2) is the Gauss-Kuzmin distribution of k. Sort the y values by size and number them consecutively by n. This sequence gives the values of n when k=1.A084581
Let y = m/GK(k), where m and k vary over the positive integers and GK(k)=log(1+1/(k*(k+2)))/log(2) is the Gauss-Kuzmin distribution of k. Sort the y values by size and number them consecutively by n. This sequence gives the values of n when k=1.
- Let y = m/GK(k), where m and k vary over the positive integers and GK(k)=log(1+1/(k*(k+2)))/log(2) is the Gauss-Kuzmin distribution of k. Sort the y values by size and number them consecutively by n. This sequence gives the values of n when k=2.A084582
Let y = m/GK(k), where m and k vary over the positive integers and GK(k)=log(1+1/(k*(k+2)))/log(2) is the Gauss-Kuzmin distribution of k. Sort the y values by size and number them consecutively by n. This sequence gives the values of n when k=2.
- Let y = m/GK(k), where m and k vary over the positive integers and GK(k)=log(1+1/(k*(k+2)))/log(2) is the Gauss-Kuzmin distribution of k. Sort the y values by size and number them consecutively by n. This sequence gives the values of n when k=3.A084583
Let y = m/GK(k), where m and k vary over the positive integers and GK(k)=log(1+1/(k*(k+2)))/log(2) is the Gauss-Kuzmin distribution of k. Sort the y values by size and number them consecutively by n. This sequence gives the values of n when k=3.
- Let y = m/GK(k), where m and k vary over the positive integers and GK(k)=log(1+1/(k*(k+2)))/log(2) is the Gauss-Kuzmin distribution of k. Sort the y values by size and number them consecutively by n. This sequence gives the values of n when k=4.A084584
Let y = m/GK(k), where m and k vary over the positive integers and GK(k)=log(1+1/(k*(k+2)))/log(2) is the Gauss-Kuzmin distribution of k. Sort the y values by size and number them consecutively by n. This sequence gives the values of n when k=4.
- Let y = m/GK(k), where m and k vary over the positive integers and GK(k)=log(1+1/(k*(k+2)))/log(2) is the Gauss-Kuzmin distribution of k. Sort the y values by size and number them consecutively by n. This sequence gives the values of n when k=5.A084585
Let y = m/GK(k), where m and k vary over the positive integers and GK(k)=log(1+1/(k*(k+2)))/log(2) is the Gauss-Kuzmin distribution of k. Sort the y values by size and number them consecutively by n. This sequence gives the values of n when k=5.
- Let y = m/GK(k), where m and k vary over the positive integers and GK(k)=log(1+1/(k*(k+2)))/log(2) is the Gauss-Kuzmin distribution of k. Sort the y values by size and number them consecutively by n. This sequence gives the values of n when k=6.A084586
Let y = m/GK(k), where m and k vary over the positive integers and GK(k)=log(1+1/(k*(k+2)))/log(2) is the Gauss-Kuzmin distribution of k. Sort the y values by size and number them consecutively by n. This sequence gives the values of n when k=6.
- Integer floor of the reciprocal of Gauss-Kuzmin distribution of n: a(n) = floor( log(2)/log(1 + 1/(n*(n+2))) ).A084587
Integer floor of the reciprocal of Gauss-Kuzmin distribution of n: a(n) = floor( log(2)/log(1 + 1/(n*(n+2))) ).
- Least positive integers, all distinct, that satisfy Sum_{n>0} 1/a(n)^z = 0, where z is the first nontrivial zero of the Riemann zeta function: z = (1/2 + i*y) with y=14.13472514173469379045...A084588
Least positive integers, all distinct, that satisfy Sum_{n>0} 1/a(n)^z = 0, where z is the first nontrivial zero of the Riemann zeta function: z = (1/2 + i*y) with y=14.13472514173469379045...
- Least positive integers, all distinct, that satisfy Sum_{n>0} 1/a(n)^z = 0, where z is the second nontrivial zero of the Riemann zeta function: z = (1/2 + i*y) with y=21.022039638771554992628...A084589
Least positive integers, all distinct, that satisfy Sum_{n>0} 1/a(n)^z = 0, where z is the second nontrivial zero of the Riemann zeta function: z = (1/2 + i*y) with y=21.022039638771554992628...
- Least positive integers, all distinct, that satisfy Sum_{n>0} 1/a(n)^z = 0, where z is the third nontrivial zero of the Riemann zeta function: z = (1/2 + i*y) with y=25.01085758014568876321379099...A084590
Least positive integers, all distinct, that satisfy Sum_{n>0} 1/a(n)^z = 0, where z is the third nontrivial zero of the Riemann zeta function: z = (1/2 + i*y) with y=25.01085758014568876321379099...
- Least positive integers, all distinct, that satisfy Sum_{n>0} 1/a(n)^z = 0, where z is the fourth nontrivial zero of the Riemann zeta function: z = (1/2 + i*y) with y=30.4248761258595132103118975...A084591
Least positive integers, all distinct, that satisfy Sum_{n>0} 1/a(n)^z = 0, where z is the fourth nontrivial zero of the Riemann zeta function: z = (1/2 + i*y) with y=30.4248761258595132103118975...
- Least positive integers, all distinct, that satisfy Sum_{n>0} 1/a(n)^z = 0, where z is the fifth nontrivial zero of the Riemann zeta function: z=(1/2 + i*y) with y=32.935061587739189690662368964...A084592
Least positive integers, all distinct, that satisfy Sum_{n>0} 1/a(n)^z = 0, where z is the fifth nontrivial zero of the Riemann zeta function: z=(1/2 + i*y) with y=32.935061587739189690662368964...
- Least positive integers, all distinct, that satisfy Sum_{n>0} 1/a(n)^z = 0, where z is the 100th nontrivial zero of the Riemann zeta function: z = (1/2 + i*y) with y=236.5242296658162058024755...A084593
Least positive integers, all distinct, that satisfy Sum_{n>0} 1/a(n)^z = 0, where z is the 100th nontrivial zero of the Riemann zeta function: z = (1/2 + i*y) with y=236.5242296658162058024755...
- a(n) = Sum_{r=0..2^(n-1)} Binomial(2^n,2r)*3^r.A084594
a(n) = Sum_{r=0..2^(n-1)} Binomial(2^n,2r)*3^r.
- For n > 0: a(n) = Sum_{r=0..2^(n-1)-1} binomial(2^n, 2r+1)*3^r.A084595
For n > 0: a(n) = Sum_{r=0..2^(n-1)-1} binomial(2^n, 2r+1)*3^r.
- a(n) is the number of times n is in sequence A014085; i.e., there are exactly a(n) cases where there are exactly n primes between m^2 and (m+1)^2 for m >= 0.A084596
a(n) is the number of times n is in sequence A014085; i.e., there are exactly a(n) cases where there are exactly n primes between m^2 and (m+1)^2 for m >= 0.
- Largest k such that there are exactly n primes between k^2 and (k+1)^2.A084597
Largest k such that there are exactly n primes between k^2 and (k+1)^2.
- a(1) = 2, a(2) = 3; for n >= 2, a(n+1) is smallest prime factor of (Product_{k = 1..n} a(k)) - 1.A084598
a(1) = 2, a(2) = 3; for n >= 2, a(n+1) is smallest prime factor of (Product_{k = 1..n} a(k)) - 1.
- a(1) = 2, a(2) = 3; for n >= 2, a(n+1) is largest prime factor of (Product_{k=1..n} a(k)) - 1.A084599
a(1) = 2, a(2) = 3; for n >= 2, a(n+1) is largest prime factor of (Product_{k=1..n} a(k)) - 1.
- Triangle, read by rows, where the n-th row lists the (2n+1) coefficients of (1+x+2x^2)^n for n >= 0.A084600
Triangle, read by rows, where the n-th row lists the (2n+1) coefficients of (1+x+2x^2)^n for n >= 0.
- Coefficients of 1/(1-2*x-7*x^2)^(1/2); also, a(n) is the central coefficient of (1+x+2*x^2)^n.A084601
Coefficients of 1/(1-2*x-7*x^2)^(1/2); also, a(n) is the central coefficient of (1+x+2*x^2)^n.
- Triangle, read by rows, where the n-th row lists the (2n+1) coefficients of (1 + x + 3x^2)^n.A084602
Triangle, read by rows, where the n-th row lists the (2n+1) coefficients of (1 + x + 3x^2)^n.
- Coefficients of 1/sqrt(1 - 2*x - 11*x^2); also, a(n) is the central coefficient of (1 + x + 3*x^2)^n.A084603
Coefficients of 1/sqrt(1 - 2*x - 11*x^2); also, a(n) is the central coefficient of (1 + x + 3*x^2)^n.
- Triangle, read by rows, where the n-th row lists the (2n+1) coefficients of (1 + x + 4x^2)^n.A084604
Triangle, read by rows, where the n-th row lists the (2n+1) coefficients of (1 + x + 4x^2)^n.
- G.f.: 1/(1-2x-15x^2)^(1/2); also, a(n) is the central coefficient of (1+x+4x^2)^n.A084605
G.f.: 1/(1-2x-15x^2)^(1/2); also, a(n) is the central coefficient of (1+x+4x^2)^n.
- Triangle, read by rows, where the n-th row lists the (2n+1) coefficients of (1+2x+2x^2)^n.A084606
Triangle, read by rows, where the n-th row lists the (2n+1) coefficients of (1+2x+2x^2)^n.
- Duplicate of A006139.A084607
Duplicate of A006139.
- Triangle, read by rows, where the n-th row lists the (2n+1) coefficients of (1+2*x+3*x^2)^n.A084608
Triangle, read by rows, where the n-th row lists the (2n+1) coefficients of (1+2*x+3*x^2)^n.
- Coefficients of 1/sqrt(1-4*x-8*x^2); also, a(n) is the central coefficient of (1+2*x+3*x^2)^n.A084609
Coefficients of 1/sqrt(1-4*x-8*x^2); also, a(n) is the central coefficient of (1+2*x+3*x^2)^n.
- Triangle, read by rows, where the n-th row lists the (2n+1) coefficients of (1+x-x^2)^n.A084610
Triangle, read by rows, where the n-th row lists the (2n+1) coefficients of (1+x-x^2)^n.