Sequences
392,541 sequences
- a(n) = floor((1+2^n+3^n)/3).A087211
a(n) = floor((1+2^n+3^n)/3).
- Number of ways in which n X n cells may be numbered using nonzero digits so that n n-digit squares are formed when read across or down the grids.A087212
Number of ways in which n X n cells may be numbered using nonzero digits so that n n-digit squares are formed when read across or down the grids.
- Expansion of (1+x-4*x^2) / ((1+x)*(1-4*x^2)).A087213
Expansion of (1+x-4*x^2) / ((1+x)*(1-4*x^2)).
- Expansion of e.g.f.: exp(x)/(1-x^2/2).A087214
Expansion of e.g.f.: exp(x)/(1-x^2/2).
- Lucas(6*n): a(n) = 18*a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 18.A087215
Lucas(6*n): a(n) = 18*a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 18.
- a(n) = (6n)!/((3n)!(2n)!2^n).A087216
a(n) = (6n)!/((3n)!(2n)!2^n).
- In decimal representation: smallest multiple of n containing it as substring.A087217
In decimal representation: smallest multiple of n containing it as substring.
- Satisfies A(x) = 1 + x*A(x)*f(x)^2, where f(x) = Sum_{k>=0} x^((3^n-1)/2) and f(x)^2 = 2 - f(x^2) + 2*Sum_{n>0} x^A023745(n).A087218
Satisfies A(x) = 1 + x*A(x)*f(x)^2, where f(x) = Sum_{k>=0} x^((3^n-1)/2) and f(x)^2 = 2 - f(x^2) + 2*Sum_{n>0} x^A023745(n).
- Satisfies A(x) = f(x) + x*A(x)*f(x)^2, where f(x) = Sum_{k>=0} x^((3^n-1)/2) and f(x)^2 = 2 - f(x^2) + 2*Sum_{n>0} x^A023745(n). Also, A(x) = f(x)*B(x), where B(x) = Sum_{k>=0} A087218(k)*x^k.A087219
Satisfies A(x) = f(x) + x*A(x)*f(x)^2, where f(x) = Sum_{k>=0} x^((3^n-1)/2) and f(x)^2 = 2 - f(x^2) + 2*Sum_{n>0} x^A023745(n). Also, A(x) = f(x)*B(x), where B(x) = Sum_{k>=0} A087218(k)*x^k.
- Coefficients in an asymptotic series expanded in powers of 1/(4x).A087220
Coefficients in an asymptotic series expanded in powers of 1/(4x).
- Number of compositions (ordered partitions) of n into powers of 4.A087221
Number of compositions (ordered partitions) of n into powers of 4.
- G.f. satisfies A(x) = 1 + x*A(x)*f(x)^3, where f(x) = Sum_{k>=0} x^((4^k-1)/3).A087222
G.f. satisfies A(x) = 1 + x*A(x)*f(x)^3, where f(x) = Sum_{k>=0} x^((4^k-1)/3).
- G.f. satisfies A(x) = f(x) + x*A(x)*f(x)^3, where f(x) = Sum_{k>=0} x^((4^k-1)/3).A087223
G.f. satisfies A(x) = f(x) + x*A(x)*f(x)^3, where f(x) = Sum_{k>=0} x^((4^k-1)/3).
- G.f. satisfies A(x) = f(x)^2 + x*A(x)*f(x)^3, where f(x) = Sum_{k>=0} x^((4^k-1)/3).A087224
G.f. satisfies A(x) = f(x)^2 + x*A(x)*f(x)^3, where f(x) = Sum_{k>=0} x^((4^k-1)/3).
- Position of the largest peak value in Collatz (3x+1) trajectory.A087225
Position of the largest peak value in Collatz (3x+1) trajectory.
- LCM of terms in Collatz (3x+1) function initiated at n.A087226
LCM of terms in Collatz (3x+1) function initiated at n.
- Number of distinct prime factors of A087226(n), the LCM of terms in trajectory of 3x+1 (function) initiated at n.A087227
Number of distinct prime factors of A087226(n), the LCM of terms in trajectory of 3x+1 (function) initiated at n.
- a(n) is the smallest number k such that the LCM of the terms of the Collatz trajectory of k has n distinct prime factors.A087228
a(n) is the smallest number k such that the LCM of the terms of the Collatz trajectory of k has n distinct prime factors.
- Exponent of p=2 in 12n+4 = 3(4n+1)+1.A087229
Exponent of p=2 in 12n+4 = 3(4n+1)+1.
- a(n) is the 2-adic valuation of 6*n + 4.A087230
a(n) is the 2-adic valuation of 6*n + 4.
- a(n) is the smallest number such that the exponent of p=2 factor in 6*a(n)+4 equals n.A087231
a(n) is the smallest number such that the exponent of p=2 factor in 6*a(n)+4 equals n.
- a(n) is the largest odd term in the 3x+1 trajectory initiated at n.A087232
a(n) is the largest odd term in the 3x+1 trajectory initiated at n.
- a(n) = floor(sigma(A002110(n))/A002110(n)); integer quotient of divisor-sum of primorial numbers and primorials.A087233
a(n) = floor(sigma(A002110(n))/A002110(n)); integer quotient of divisor-sum of primorial numbers and primorials.
- Smallest deficient number with n distinct prime factors.A087234
Smallest deficient number with n distinct prime factors.
- a(n) is the largest number in the set of solutions to n=x/pi(x), where pi(x)=A000720(x).A087235
a(n) is the largest number in the set of solutions to n=x/pi(x), where pi(x)=A000720(x).
- a(n) is the difference between the largest and smallest integer solutions to n=x/pi(x), where pi(x) = A000720(x).A087236
a(n) is the difference between the largest and smallest integer solutions to n=x/pi(x), where pi(x) = A000720(x).
- a(n) = (Max{x : n*pi(x) = x} - Min{x : n*pi(x) = x})/n = A087236(n)/n.A087237
a(n) = (Max{x : n*pi(x) = x} - Min{x : n*pi(x) = x})/n = A087236(n)/n.
- First differences of A057809.A087238
First differences of A057809.
- First differences of A038625.A087239
First differences of A038625.
- First differences of A087235.A087240
First differences of A087235.
- Consecutive min and max-terms of solution-clusters of A057809, i,e, least and largest solutions to n=x/A000720[x].A087241
Consecutive min and max-terms of solution-clusters of A057809, i,e, least and largest solutions to n=x/A000720[x].
- Smallest prime number p such that n+p = q is also a prime, or 0 if no such prime number exists.A087242
Smallest prime number p such that n+p = q is also a prime, or 0 if no such prime number exists.
- a(n) = n + A087242(n) or a(n)=0 if A087242(n)=0; the primes arising as n + A087242(n).A087243
a(n) = n + A087242(n) or a(n)=0 if A087242(n)=0; the primes arising as n + A087242(n).
- Nonsquarefree deficient numbers.A087244
Nonsquarefree deficient numbers.
- Nonsquarefree abundant numbers.A087245
Nonsquarefree abundant numbers.
- Squarefree deficient numbers.A087246
Squarefree deficient numbers.
- Squarefree deficient nonprime numbers.A087247
Squarefree deficient nonprime numbers.
- Squarefree abundant numbers.A087248
Squarefree abundant numbers.
- Squarefree numbers k such that sigma(k) is not squarefree.A087249
Squarefree numbers k such that sigma(k) is not squarefree.
- Duplicate of A065301.A087250
Duplicate of A065301.
- Distinct largest-peak-values in 3x+1 trajectory arranged by their first appearance as initial value increases. A025586 without repetitions while keeping order.A087251
Distinct largest-peak-values in 3x+1 trajectory arranged by their first appearance as initial value increases. A025586 without repetitions while keeping order.
- Numbers that are divisible by 4, but cannot be the largest peak value in a 3x+1 trajectory, regardless of the initial value.A087252
Numbers that are divisible by 4, but cannot be the largest peak value in a 3x+1 trajectory, regardless of the initial value.
- Number of distinct initial values of various 3x+1 trajectories of which the peak-value equals 4n.A087253
Number of distinct initial values of various 3x+1 trajectories of which the peak-value equals 4n.
- If we start the Collatz-iteration at these values, each divisible by 4, all subsequent terms in trajectory are smaller than the initial value.A087254
If we start the Collatz-iteration at these values, each divisible by 4, all subsequent terms in trajectory are smaller than the initial value.
- Number of different initial values for 3x+1 trajectories of which the largest term appearing during the iteration equals n.A087255
Number of different initial values for 3x+1 trajectories of which the largest term appearing during the iteration equals n.
- Number of different initial values for 3x+1 trajectories in which the largest term appearing in the iteration is 2^n.A087256
Number of different initial values for 3x+1 trajectories in which the largest term appearing in the iteration is 2^n.
- Duplicate of A033496.A087257
Duplicate of A033496.
- a(n) = gcd(n, A025586(n)), greatest common divisor of n and largest value in 3x+1 iteration list started at n.A087258
a(n) = gcd(n, A025586(n)), greatest common divisor of n and largest value in 3x+1 iteration list started at n.
- a(n) = lcm(n, A025586(n)), least common multiple of n and largest value in 3x+1 iteration list started at n.A087259
a(n) = lcm(n, A025586(n)), least common multiple of n and largest value in 3x+1 iteration list started at n.
- a(n) = gcd(4n, A025586(4n)), greatest common divisor of 4n and largest value in 3x+1 iteration list started at 4n.A087260
a(n) = gcd(4n, A025586(4n)), greatest common divisor of 4n and largest value in 3x+1 iteration list started at 4n.