Sequences
392,541 sequences
- Duplicate of A051856.A084811
Duplicate of A051856.
- a(1)=1; for n >= 2, choose a(n) so that |Sum_{k=1..n} 1/a(k)^z| < |Sum_{k=1..n-1} 1/a(k)^z|, where z = 1/2 + i*2*Pi.A084812
a(1)=1; for n >= 2, choose a(n) so that |Sum_{k=1..n} 1/a(k)^z| < |Sum_{k=1..n-1} 1/a(k)^z|, where z = 1/2 + i*2*Pi.
- Least integers that satisfy sum(n>0,1/a(n)^z)=0, where a(1)=1, a(n+1)>a(n) and z=I.A084813
Least integers that satisfy sum(n>0,1/a(n)^z)=0, where a(1)=1, a(n+1)>a(n) and z=I.
- Least integers that satisfy Sum_{n>=1} 1/a(n)^z = 0, where a(1)=1, a(n+1) > a(n) and z = i*Pi/2.A084814
Least integers that satisfy Sum_{n>=1} 1/a(n)^z = 0, where a(1)=1, a(n+1) > a(n) and z = i*Pi/2.
- Least integers that satisfy Sum_{n>=1} 1/a(n)^z = 0, where a(1)=1, a(n+1) > a(n) and z = i*Pi/4.A084815
Least integers that satisfy Sum_{n>=1} 1/a(n)^z = 0, where a(1)=1, a(n+1) > a(n) and z = i*Pi/4.
- Least integers that satisfy sum(n>0,1/a(n)^z)=0, where a(1)=1, a(n+1)>a(n) and z=I*2.A084816
Least integers that satisfy sum(n>0,1/a(n)^z)=0, where a(1)=1, a(n+1)>a(n) and z=I*2.
- Least integers that satisfy sum(n>0,1/a(n)^z)=0, where a(1)=1, a(n+1)>a(n) and z=I/log(2).A084817
Least integers that satisfy sum(n>0,1/a(n)^z)=0, where a(1)=1, a(n+1)>a(n) and z=I/log(2).
- Least integers that satisfy sum(n>0,1/a(n)^z)=0, where a(1)=1, a(n+1)>a(n) and z=I/log(3).A084818
Least integers that satisfy sum(n>0,1/a(n)^z)=0, where a(1)=1, a(n+1)>a(n) and z=I/log(3).
- Least integers that satisfy Sum_{n>=1} 1/a(n)^z = 0, where a(1)=1, a(n+1) > a(n) and z = i*Pi/(4*log(2)).A084819
Least integers that satisfy Sum_{n>=1} 1/a(n)^z = 0, where a(1)=1, a(n+1) > a(n) and z = i*Pi/(4*log(2)).
- Numbers n such that n, sigma(n) and phi(n) form an integer triangle, where sigma=A000203 is the divisor sum and phi=A000010 the totient.A084820
Numbers n such that n, sigma(n) and phi(n) form an integer triangle, where sigma=A000203 is the divisor sum and phi=A000010 the totient.
- Odd numbers m such that sigma(m) > m + phi(m), where sigma=A000203 is the divisor sum and phi=A000010 the totient.A084821
Odd numbers m such that sigma(m) > m + phi(m), where sigma=A000203 is the divisor sum and phi=A000010 the totient.
- Signature sequence of x, where x=0.577284608955710564894... (A084823) is the unique number between 0 and 1 having the property that the signature sequence of x is equal to the continued fraction expansion of x.A084822
Signature sequence of x, where x=0.577284608955710564894... (A084823) is the unique number between 0 and 1 having the property that the signature sequence of x is equal to the continued fraction expansion of x.
- Decimal expansion of x, where x is the unique number, given floor(x)=0, having the property that the signature sequence of x is equal to the continued fraction expansion of x.A084823
Decimal expansion of x, where x is the unique number, given floor(x)=0, having the property that the signature sequence of x is equal to the continued fraction expansion of x.
- Maximum number of spheres of diameter one that can be packed in a cube of volume n (i.e., with edge length n^(1/3)).A084824
Maximum number of spheres of diameter one that can be packed in a cube of volume n (i.e., with edge length n^(1/3)).
- Maximum number of spheres of diameter one that can be packed in a cube of edge length n.A084825
Maximum number of spheres of diameter one that can be packed in a cube of edge length n.
- Best packing of m>1 equal spheres in a cube setting a new density record.A084826
Best packing of m>1 equal spheres in a cube setting a new density record.
- Maximum number of spheres of volume one that can be packed in a sphere of volume n.A084827
Maximum number of spheres of volume one that can be packed in a sphere of volume n.
- Maximum number of spheres of radius one that can be packed in a sphere of radius n.A084828
Maximum number of spheres of radius one that can be packed in a sphere of radius n.
- Best packing of m>1 equal spheres in a sphere setting a new density record.A084829
Best packing of m>1 equal spheres in a sphere setting a new density record.
- Numbers k such that (k!)^2 + k! - 1 is prime.A084830
Numbers k such that (k!)^2 + k! - 1 is prime.
- Numbers n such that sum of odd divisors and sum of even divisors are both palindromic.A084831
Numbers n such that sum of odd divisors and sum of even divisors are both palindromic.
- Numbers k such that 2*R_k - 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k.A084832
Numbers k such that 2*R_k - 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- a(n) is the smallest number such that a(n) + a(n-1), a(n) + a(n-1) + a(n-2), ..., a(n) + ... + a(1) are nonprime.A084833
a(n) is the smallest number such that a(n) + a(n-1), a(n) + a(n-1) + a(n-2), ..., a(n) + ... + a(1) are nonprime.
- a(n) is the smallest number not previously used such that a(n)+a(n-1), a(n)+a(n-1)+a(n-2), ..., a(n)+...+a(1) are not prime.A084834
a(n) is the smallest number not previously used such that a(n)+a(n-1), a(n)+a(n-1)+a(n-2), ..., a(n)+...+a(1) are not prime.
- a(n) = A000094(n+4) - A006918(n).A084835
a(n) = A000094(n+4) - A006918(n).
- Palindromic primes with nondecreasing digits up to the middle and then nonincreasing.A084836
Palindromic primes with nondecreasing digits up to the middle and then nonincreasing.
- Palindromic primes with nonincreasing digits up to the middle and then nondecreasing.A084837
Palindromic primes with nonincreasing digits up to the middle and then nondecreasing.
- Smallest integers that satisfy sum(n>0, mu( a(n) )/a(n))=0 by requiring that the absolute value of the successive partial sums are monotonically decreasing in magnitude, where a(1)=1 and a(n+1)>a(n) for n>0.A084838
Smallest integers that satisfy sum(n>0, mu( a(n) )/a(n))=0 by requiring that the absolute value of the successive partial sums are monotonically decreasing in magnitude, where a(1)=1 and a(n+1)>a(n) for n>0.
- Smallest integers that satisfy sum(n>0, mu(a(n))*log(a(n))/a(n))=-1 by requiring that the absolute values of 1 + the successive partial sums are monotonically decreasing in magnitude, where a(1)=1 and a(n+1)>a(n) for n>0.A084839
Smallest integers that satisfy sum(n>0, mu(a(n))*log(a(n))/a(n))=-1 by requiring that the absolute values of 1 + the successive partial sums are monotonically decreasing in magnitude, where a(1)=1 and a(n+1)>a(n) for n>0.
- Write the numbers 1, 2, ... in a triangle with n terms in the n-th row; a(n) = number of abundant integers in n-th row.A084840
Write the numbers 1, 2, ... in a triangle with n terms in the n-th row; a(n) = number of abundant integers in n-th row.
- Write the numbers 1, 2, ... in a triangle with n terms in the n-th row; a(n) = number of deficient integers in n-th row.A084841
Write the numbers 1, 2, ... in a triangle with n terms in the n-th row; a(n) = number of deficient integers in n-th row.
- Number of rooted trees with n nodes with a height of 2 and with at least 1 node at height 1 has degree > 2.A084842
Number of rooted trees with n nodes with a height of 2 and with at least 1 node at height 1 has degree > 2.
- Numbers n such that no palindrome m > 0 exists with n + m also a palindrome.A084843
Numbers n such that no palindrome m > 0 exists with n + m also a palindrome.
- Denominators of the continued fraction n + 1/(n + 1/...) [n times].A084844
Denominators of the continued fraction n + 1/(n + 1/...) [n times].
- Numerators of the continued fraction n+1/(n+1/...) [n times].A084845
Numerators of the continued fraction n+1/(n+1/...) [n times].
- mu(n!+1), where mu is the Moebius function (A008683).A084846
mu(n!+1), where mu is the Moebius function (A008683).
- a(n) = 2*3^n+2^(2n-1)*(n-2).A084847
a(n) = 2*3^n+2^(2n-1)*(n-2).
- a(n) is the number of quadratic residues of A085635(n).A084848
a(n) is the number of quadratic residues of A085635(n).
- a(n) = 1 + n + 2*n^2.A084849
a(n) = 1 + n + 2*n^2.
- 2^(n-1)*(n^2+2n+2).A084850
2^(n-1)*(n^2+2n+2).
- Binomial transform of binomial(n+2,2).A084851
Binomial transform of binomial(n+2,2).
- Numbers k such that k^(k+1) + (k+1)^k - k(k+1) is prime.A084852
Numbers k such that k^(k+1) + (k+1)^k - k(k+1) is prime.
- Numbers k such that k^(k+1) + (k+1)^k + k(k+1) is prime.A084853
Numbers k such that k^(k+1) + (k+1)^k + k(k+1) is prime.
- Triangular array, read by rows: T(n,k) = concatenated decimal representations of n and k, 1<=k<=n.A084854
Triangular array, read by rows: T(n,k) = concatenated decimal representations of n and k, 1<=k<=n.
- Triangular array, read by rows: T(n,k) = concatenated decimal representations of k and n, 1<=k<=n.A084855
Triangular array, read by rows: T(n,k) = concatenated decimal representations of k and n, 1<=k<=n.
- a(n) = prime(n+2)^2 - prime(n)^2.A084856
a(n) = prime(n+2)^2 - prime(n)^2.
- Inverse binomial transform of n^2*3^(n-1).A084857
Inverse binomial transform of n^2*3^(n-1).
- Binomial transform of A001651.A084858
Binomial transform of A001651.
- Binomial transform of Cullen numbers A002064.A084859
Binomial transform of Cullen numbers A002064.
- Expansion of (1 - 2x + 2x^2 - x^3)/(1 - 2x)^2.A084860
Expansion of (1 - 2x + 2x^2 - x^3)/(1 - 2x)^2.