Sequences
392,541 sequences
- Greatest prime factor of 3-smooth numbers.A086411
Greatest prime factor of 3-smooth numbers.
- Number of distinct prime factors of 3-smooth numbers.A086412
Number of distinct prime factors of 3-smooth numbers.
- Duplicate of A069352.A086413
Duplicate of A069352.
- Minimal exponent in prime factorization of 3-smooth numbers.A086414
Minimal exponent in prime factorization of 3-smooth numbers.
- Maximal exponent in prime factorization of 3-smooth numbers.A086415
Maximal exponent in prime factorization of 3-smooth numbers.
- Number of divisors of 3-smooth numbers.A086416
Number of divisors of 3-smooth numbers.
- Sum of divisors of 3-smooth numbers.A086417
Sum of divisors of 3-smooth numbers.
- Sum of distinct prime factors of 3-smooth numbers.A086418
Sum of distinct prime factors of 3-smooth numbers.
- Sum of all prime factors of 3-smooth numbers.A086419
Sum of all prime factors of 3-smooth numbers.
- Euler's totient of 3-smooth numbers: a(n) = A000010(A003586(n)).A086420
Euler's totient of 3-smooth numbers: a(n) = A000010(A003586(n)).
- Erroneous version of A000120.A086421
Erroneous version of A000120.
- Duplicate of A046880.A086422
Duplicate of A046880.
- Number of isolated-pentagon fullerenes with 2n vertices (or carbon atoms).A086423
Number of isolated-pentagon fullerenes with 2n vertices (or carbon atoms).
- Numbers needed to generate all other natural numbers, only allowing multiplication and addition. Each number can be used only once.A086424
Numbers needed to generate all other natural numbers, only allowing multiplication and addition. Each number can be used only once.
- Permutation of natural numbers induced by the Catalan bijection gma086425 acting on symbolless S-expressions encoded by A014486/A063171.A086425
Permutation of natural numbers induced by the Catalan bijection gma086425 acting on symbolless S-expressions encoded by A014486/A063171.
- Permutation of natural numbers induced by the Catalan bijection gma086426 acting on symbolless S-expressions encoded by A014486/A063171.A086426
Permutation of natural numbers induced by the Catalan bijection gma086426 acting on symbolless S-expressions encoded by A014486/A063171.
- Permutation of natural numbers induced by the Catalan bijection gma086427 acting on symbolless S-expressions encoded by A014486/A063171.A086427
Permutation of natural numbers induced by the Catalan bijection gma086427 acting on symbolless S-expressions encoded by A014486/A063171.
- Permutation of natural numbers induced by the Catalan bijection gma086428 acting on symbolless S-expressions encoded by A014486/A063171.A086428
Permutation of natural numbers induced by the Catalan bijection gma086428 acting on symbolless S-expressions encoded by A014486/A063171.
- Permutation of natural numbers induced by the Catalan bijection gma086429 acting on symbolless S-expressions encoded by A014486/A063171.A086429
Permutation of natural numbers induced by the Catalan bijection gma086429 acting on symbolless S-expressions encoded by A014486/A063171.
- Permutation of natural numbers induced by the Catalan bijection gma086430 acting on symbolless S-expressions encoded by A014486/A063171.A086430
Permutation of natural numbers induced by the Catalan bijection gma086430 acting on symbolless S-expressions encoded by A014486/A063171.
- Involution of natural numbers induced by the Catalan bijection gma086431 acting on symbolless S-expressions encoded by A014486/A063171.A086431
Involution of natural numbers induced by the Catalan bijection gma086431 acting on symbolless S-expressions encoded by A014486/A063171.
- Maximum of |det(A)| where A is an n X n circulant (0,1) matrix over the integers.A086432
Maximum of |det(A)| where A is an n X n circulant (0,1) matrix over the integers.
- Contraction-permutation of A085169: a(n) = A082853(A085169(A081291(n))).A086433
Contraction-permutation of A085169: a(n) = A082853(A085169(A081291(n))).
- Contraction-permutation of A085170: a(n) = A082853(A085170(A081291(n))).A086434
Contraction-permutation of A085170: a(n) = A082853(A085170(A081291(n))).
- Maximum number of parts possible in a factorization of n into a product of distinct numbers > 1.A086435
Maximum number of parts possible in a factorization of n into a product of distinct numbers > 1.
- Maximum number of parts possible in a factorization of n; a(1) = 1, and for n > 1, a(n) = A001222(n) = bigomega(n).A086436
Maximum number of parts possible in a factorization of n; a(1) = 1, and for n > 1, a(n) = A001222(n) = bigomega(n).
- Triangle of number C(3; m,k) of arrangements of k objects of one type and m of another such that no 3-run occurs.A086437
Triangle of number C(3; m,k) of arrangements of k objects of one type and m of another such that no 3-run occurs.
- Probability of obtaining a run of n consecutive cards of the same color in a deck of 52, normalized by binomial(52,26).A086438
Probability of obtaining a run of n consecutive cards of the same color in a deck of 52, normalized by binomial(52,26).
- Probability of obtaining a run of n consecutive cards of the same color in a deck of 52, numerators.A086439
Probability of obtaining a run of n consecutive cards of the same color in a deck of 52, numerators.
- Probability of obtaining a run of n consecutive cards of the same color in a deck of 52, denominators.A086440
Probability of obtaining a run of n consecutive cards of the same color in a deck of 52, denominators.
- Number of inequivalent ways a semi-infinite curve can cross a straight line n times.A086441
Number of inequivalent ways a semi-infinite curve can cross a straight line n times.
- a(n) = A086323(n)/n.A086442
a(n) = A086323(n)/n.
- Expansion of x^2/((1-4*x)*(1-3*x)^2).A086443
Expansion of x^2/((1-4*x)*(1-3*x)^2).
- Sequence associated with palindromic structures.A086444
Sequence associated with palindromic structures.
- Partial sums of A005578.A086445
Partial sums of A005578.
- Integers representable as the product of the sum of three positive integers with the sum of their reciprocals: n=(x+y+z)*(1/x+1/y+1/z).A086446
Integers representable as the product of the sum of three positive integers with the sum of their reciprocals: n=(x+y+z)*(1/x+1/y+1/z).
- a(n) = the least k such that prime(n+1)+prime(n+2)+...+prime(n+k) is a multiple of prime(n).A086447
a(n) = the least k such that prime(n+1)+prime(n+2)+...+prime(n+k) is a multiple of prime(n).
- a(n) = the least integer of the form [prime(n+1)+prime(n+2)+...+prime(n+k)]/prime(n).A086448
a(n) = the least integer of the form [prime(n+1)+prime(n+2)+...+prime(n+k)]/prime(n).
- a(0) = 1, a(2n+1) = a(n), a(2n) = a(n) + a(n-1) + ... + a(n-2^m) + ... where a(n) = 0 for n < 0.A086449
a(0) = 1, a(2n+1) = a(n), a(2n) = a(n) + a(n-1) + ... + a(n-2^m) + ... where a(n) = 0 for n < 0.
- a(0) = 1, a(2n+1) = a(n), a(2n) = a(n) + a(n-1) + ... + a(n-m) + ... where a(n<0) = 0.A086450
a(0) = 1, a(2n+1) = a(n), a(2n) = a(n) + a(n-1) + ... + a(n-m) + ... where a(n<0) = 0.
- Numbers not in A086335.A086451
Numbers not in A086335.
- Number of maximal triangulations (using all 2(n+2) points) of a convex polygon having (n+2) sides and an interior point in the middle of each side.A086452
Number of maximal triangulations (using all 2(n+2) points) of a convex polygon having (n+2) sides and an interior point in the middle of each side.
- Least difference between 5^n and a power of 2.A086453
Least difference between 5^n and a power of 2.
- Number of divisors of prime powers: tau(p^e).A086454
Number of divisors of prime powers: tau(p^e).
- Sum of divisors of prime powers: sigma(p^e).A086455
Sum of divisors of prime powers: sigma(p^e).
- Expansion of (1 + x + sqrt(1 - 6*x + x^2))/2 in powers of x.A086456
Expansion of (1 + x + sqrt(1 - 6*x + x^2))/2 in powers of x.
- Both n and n^2 have the same initial digit and also n and n^2 have the same final digit when expressed in base 10.A086457
Both n and n^2 have the same initial digit and also n and n^2 have the same final digit when expressed in base 10.
- Both n and n^3 have the same initial digit and also n and n^3 have the same final digit when expressed in base 10.A086458
Both n and n^3 have the same initial digit and also n and n^3 have the same final digit when expressed in base 10.
- Determinant of the circulant matrix whose rows are formed by successively rotating the vector (1, 2, 4, 8, ..., 2^(n-1)) right.A086459
Determinant of the circulant matrix whose rows are formed by successively rotating the vector (1, 2, 4, 8, ..., 2^(n-1)) right.
- Square array read by antidiagonals: A(n, k) = n*k + 0^k.A086460
Square array read by antidiagonals: A(n, k) = n*k + 0^k.