Sequences
392,541 sequences
- Minimal number of edit-steps (insert, delete, substitute) to obtain in decimal representation the least number greater n that contains all digits of n (A083310).A083311
Minimal number of edit-steps (insert, delete, substitute) to obtain in decimal representation the least number greater n that contains all digits of n (A083310).
- Largest integer m such that 1+2+...+m divides n.A083312
Largest integer m such that 1+2+...+m divides n.
- a(0)=1; a(n) = 3^n - 2^(n-1) for n >= 1.A083313
a(0)=1; a(n) = 3^n - 2^(n-1) for n >= 1.
- (2*4^n-(3^n-1))/2.A083314
(2*4^n-(3^n-1))/2.
- a(n) = (2*5^n-(4^n-2^n))/2.A083315
a(n) = (2*5^n-(4^n-2^n))/2.
- a(n) = (2*6^n - (5^n - 3^n))/2.A083316
a(n) = (2*6^n - (5^n - 3^n))/2.
- Erroneous version of A005047.A083317
Erroneous version of A005047.
- a(0) = 1; for n>0, a(n) = 2^n + 1.A083318
a(0) = 1; for n>0, a(n) = 2^n + 1.
- 4^n+3^n-2^n.A083319
4^n+3^n-2^n.
- a(n) = 5^n + 4^n - 3^n.A083320
a(n) = 5^n + 4^n - 3^n.
- a(n) = (-1)^n + (-2)^n - (-3)^n.A083321
a(n) = (-1)^n + (-2)^n - (-3)^n.
- a(n) = 2^n - A081374(n).A083322
a(n) = 2^n - A081374(n).
- a(n) = 3^n - 2^n + 1.A083323
a(n) = 3^n - 2^n + 1.
- a(n) = 4^n - 3^n + 2^n.A083324
a(n) = 4^n - 3^n + 2^n.
- a(n) = 5^n - 4^n + 3^n.A083325
a(n) = 5^n - 4^n + 3^n.
- a(n) = 6^n - 5^n + 4^n.A083326
a(n) = 6^n - 5^n + 4^n.
- a(n) = (5^n - 4^n + 3^n - 2^n)/2.A083327
a(n) = (5^n - 4^n + 3^n - 2^n)/2.
- a(n) = (6^n - 5^n + 4^n - 3^n)/2.A083328
a(n) = (6^n - 5^n + 4^n - 3^n)/2.
- a(0) = 1; for n > 0, a(n) = 3*2^(n-1) - 1.A083329
a(0) = 1; for n > 0, a(n) = 3*2^(n-1) - 1.
- a(n) = (3*4^n - 2*3^n + 2^n)/2.A083330
a(n) = (3*4^n - 2*3^n + 2^n)/2.
- a(n) = (3*5^n - 2*4^n + 3^n)/2.A083331
a(n) = (3*5^n - 2*4^n + 3^n)/2.
- a(n) = 10*a(n-2) - 16*a(n-4) for n > 3, a(0) = 1, a(1) = 5, a(2) = 14, a(3) = 34.A083332
a(n) = 10*a(n-2) - 16*a(n-4) for n > 3, a(0) = 1, a(1) = 5, a(2) = 14, a(3) = 34.
- a(n) = 10*a(n-2) - 16*a(n-4) for n>=4, with a(0)=a(1)=1, a(2)=6, a(3)=10.A083333
a(n) = 10*a(n-2) - 16*a(n-4) for n>=4, with a(0)=a(1)=1, a(2)=6, a(3)=10.
- a(n) = 12*a(n-2) - 25*a(n-4) with initial terms 1,6,17,47.A083334
a(n) = 12*a(n-2) - 25*a(n-4) with initial terms 1,6,17,47.
- a(n) = 12*a(n-2) - 25*a(n-4) with initial terms 1,1,7,12.A083335
a(n) = 12*a(n-2) - 25*a(n-4) with initial terms 1,1,7,12.
- a(n) = 4*a(n-2) - a(n-4).A083336
a(n) = 4*a(n-2) - a(n-4).
- a(n) = 2*a(n-1) + 2*a(n-2); a(0)=0, a(1)=3.A083337
a(n) = 2*a(n-1) + 2*a(n-2); a(0)=0, a(1)=3.
- Number of partitions of odd numbers into three primes and of even numbers into two primes.A083338
Number of partitions of odd numbers into three primes and of even numbers into two primes.
- a(n) is the number of distinct prime factors of n that occur in partitions into two primes when n is even and into three primes when n is odd.A083339
a(n) is the number of distinct prime factors of n that occur in partitions into two primes when n is even and into three primes when n is odd.
- Numbers n such that A020549(n)=(n!)^2+1 is a semiprime.A083340
Numbers n such that A020549(n)=(n!)^2+1 is a semiprime.
- Smaller factor of the n-th semiprime of the form (m!)^2 + 1.A083341
Smaller factor of the n-th semiprime of the form (m!)^2 + 1.
- Decimal expansion of average deviation of the total number of prime factors.A083342
Decimal expansion of average deviation of the total number of prime factors.
- Decimal expansion of constant B3 (or B_3) related to the Mertens constant.A083343
Decimal expansion of constant B3 (or B_3) related to the Mertens constant.
- a(n) = A082457(n) - A066715(n) = gcd(2n+1, A057643(2n+1)) - gcd(2n+1, A000203(2n+1)).A083344
a(n) = A082457(n) - A066715(n) = gcd(2n+1, A057643(2n+1)) - gcd(2n+1, A000203(2n+1)).
- Numerator of r(n) = Sum(e/p: n=Product(p^e)); a(n) = n' / gcd(n,n'), where n' is the arithmetic derivative of n.A083345
Numerator of r(n) = Sum(e/p: n=Product(p^e)); a(n) = n' / gcd(n,n'), where n' is the arithmetic derivative of n.
- Denominator of r(n) = Sum(e/p: n=Product(p^e)).A083346
Denominator of r(n) = Sum(e/p: n=Product(p^e)).
- Numbers k such that Sum(e/p: k=Product(p^e)) < 1.A083347
Numbers k such that Sum(e/p: k=Product(p^e)) < 1.
- Numbers k such that r(k) = Sum(e/p: k = Product(p^e)) > 1.A083348
Numbers k such that r(k) = Sum(e/p: k = Product(p^e)) > 1.
- Least positive integers not appearing previously such that the self-convolution cube-root of this sequence consists entirely of integers.A083349
Least positive integers not appearing previously such that the self-convolution cube-root of this sequence consists entirely of integers.
- Integer coefficients of a power series A(x) such that A(x)^3 = A083349(x).A083350
Integer coefficients of a power series A(x) such that A(x)^3 = A083349(x).
- Numbers n such that 5*7^n + 2 is prime.A083351
Numbers n such that 5*7^n + 2 is prime.
- Least positive integer coefficients of power series A(x) such that the coefficients of A(x)^2 + A(x) - 1 consist entirely of squares.A083352
Least positive integer coefficients of power series A(x) such that the coefficients of A(x)^2 + A(x) - 1 consist entirely of squares.
- Coefficients of power series A(x) consist entirely of squares, where A(x) = A083352(x)^2 + A083352(x) - 1.A083353
Coefficients of power series A(x) consist entirely of squares, where A(x) = A083352(x)^2 + A083352(x) - 1.
- Square root of coefficients of power series: A083352(x)^2 + A083352(x) - 1; term-by-term square root of A083353.A083354
Square root of coefficients of power series: A083352(x)^2 + A083352(x) - 1; term-by-term square root of A083353.
- Number of preferential arrangements for the set partitions of the n-set [1,2,3,...,n].A083355
Number of preferential arrangements for the set partitions of the n-set [1,2,3,...,n].
- Total area of all incongruent integer-sided rectangles of area <= n.A083356
Total area of all incongruent integer-sided rectangles of area <= n.
- Numbers n such that A083356(n) (the total area of all incongruent integer-sided rectangles of area <= n) is a square.A083357
Numbers n such that A083356(n) (the total area of all incongruent integer-sided rectangles of area <= n) is a square.
- Square root of n-th perfect square in A083356.A083358
Square root of n-th perfect square in A083356.
- Visible factor numbers (VFNs): composite numbers k with the property that every prime factor of k can be found in the decimal expansion of k and every digit of k can be covered by a prime factor.A083359
Visible factor numbers (VFNs): composite numbers k with the property that every prime factor of k can be found in the decimal expansion of k and every digit of k can be covered by a prime factor.
- Subsequence of sequence A083359 in which factors do not overlap in the number.A083360
Subsequence of sequence A083359 in which factors do not overlap in the number.