Sequences
392,541 sequences
- Number of factorizations into distinct prime powers greater than 1.A050361
Number of factorizations into distinct prime powers greater than 1.
- Number of factorizations into distinct prime powers >1 indexed by prime signatures.A050362
Number of factorizations into distinct prime powers >1 indexed by prime signatures.
- Number of ordered factorizations into prime powers greater than 1.A050363
Number of ordered factorizations into prime powers greater than 1.
- Number of ordered factorizations into prime powers >1 indexed by prime signatures. A050363(A025487).A050364
Number of ordered factorizations into prime powers >1 indexed by prime signatures. A050363(A025487).
- a(n) is the number of ways to write n as an identity mterm, where an identity mterm is an unordered sum which is either 2, or 1 + an unordered product of distinct identity mterms.A050365
a(n) is the number of ways to write n as an identity mterm, where an identity mterm is an unordered sum which is either 2, or 1 + an unordered product of distinct identity mterms.
- Number of ways to write n as an lterm, where an lterm is an unordered sum which is either 2, or 1 + an ordered product of lterms.A050366
Number of ways to write n as an lterm, where an lterm is an unordered sum which is either 2, or 1 + an ordered product of lterms.
- Number of ways to factor n into 2 kinds of 2, 3 kinds of 3, ...A050367
Number of ways to factor n into 2 kinds of 2, 3 kinds of 3, ...
- Number of ways to factor n into distinct factors with 2 kinds of 2, 3 kinds of 3, ...A050368
Number of ways to factor n into distinct factors with 2 kinds of 2, 3 kinds of 3, ...
- Number of ordered factorizations of n into 2 kinds of 2, 3 kinds of 3, ...A050369
Number of ordered factorizations of n into 2 kinds of 2, 3 kinds of 3, ...
- Number of ways to factor n into composite factors.A050370
Number of ways to factor n into composite factors.
- Number of factorizations into composite numbers indexed by prime signatures. A050370(A025487).A050371
Number of factorizations into composite numbers indexed by prime signatures. A050370(A025487).
- Number of ways to factor n into distinct composite factors.A050372
Number of ways to factor n into distinct composite factors.
- Number of factorizations into distinct composite numbers indexed by prime signatures.A050373
Number of factorizations into distinct composite numbers indexed by prime signatures.
- Number of ordered factorizations of n into composite factors.A050374
Number of ordered factorizations of n into composite factors.
- Number of ordered factorizations into composite numbers indexed by prime signatures: A050374(A025487(n)).A050375
Number of ordered factorizations into composite numbers indexed by prime signatures: A050374(A025487(n)).
- "Fermi-Dirac primes": numbers of the form p^(2^k) where p is prime and k >= 0.A050376
"Fermi-Dirac primes": numbers of the form p^(2^k) where p is prime and k >= 0.
- Number of ways to factor n into "Fermi-Dirac primes" (members of A050376).A050377
Number of ways to factor n into "Fermi-Dirac primes" (members of A050376).
- Number of factorizations into members of A050376 by prime signature. A050377(A025487).A050378
Number of factorizations into members of A050376 by prime signature. A050377(A025487).
- Number of ordered factorizations of n into members of A050376.A050379
Number of ordered factorizations of n into members of A050376.
- Number of ordered factorizations into terms of A050376 by prime signature.A050380
Number of ordered factorizations into terms of A050376 by prime signature.
- Number of series-reduced planted trees with n leaves of 2 colors.A050381
Number of series-reduced planted trees with n leaves of 2 colors.
- Number of ordered factorizations of n into primes by prime signature: A008480(A025487).A050382
Number of ordered factorizations of n into primes by prime signature: A008480(A025487).
- Permutation rooted trees with n nodes.A050383
Permutation rooted trees with n nodes.
- Nonprimes such that n and phi(n) are relatively prime.A050384
Nonprimes such that n and phi(n) are relatively prime.
- Reversion of Moebius function A008683.A050385
Reversion of Moebius function A008683.
- Exponential reversion of Moebius function A008683.A050386
Exponential reversion of Moebius function A008683.
- Reversion of Liouville's lambda function A008836.A050387
Reversion of Liouville's lambda function A008836.
- Exponential reversion of Liouville's lambda function A008836.A050388
Exponential reversion of Liouville's lambda function A008836.
- Reversion of divisor function A000005.A050389
Reversion of divisor function A000005.
- Exponential reversion of divisor function A000005.A050390
Exponential reversion of divisor function A000005.
- Reversion of Euler totient function A000010.A050391
Reversion of Euler totient function A000010.
- Exponential reversion of Euler totient function A000010.A050392
Exponential reversion of Euler totient function A000010.
- Reversion of partitions into distinct parts A000009.A050393
Reversion of partitions into distinct parts A000009.
- Exponential reversion of partitions into distinct parts A000009.A050394
Exponential reversion of partitions into distinct parts A000009.
- Reversion of rooted trees A000081.A050395
Reversion of rooted trees A000081.
- Exponential reversion of rooted trees A000081.A050396
Exponential reversion of rooted trees A000081.
- Reversion of sequence of involutions (A000085).A050397
Reversion of sequence of involutions (A000085).
- Exponential reversion of sequence of involutions (A000085).A050398
Exponential reversion of sequence of involutions (A000085).
- Least k such that n = A009195(k) (= gcd(phi(k), k)).A050399
Least k such that n = A009195(k) (= gcd(phi(k), k)).
- Number of independent sets of vertices in P_3 X C_n (n > 2).A050400
Number of independent sets of vertices in P_3 X C_n (n > 2).
- Number of independent sets of nodes in P_4 X C_n (n > 2).A050401
Number of independent sets of nodes in P_4 X C_n (n > 2).
- Number of independent sets of nodes in C_4 X C_n (n > 2).A050402
Number of independent sets of nodes in C_4 X C_n (n > 2).
- Partial sums of A051877.A050403
Partial sums of A051877.
- Partial sums of A051878.A050404
Partial sums of A051878.
- Partial sums of A051879.A050405
Partial sums of A051879.
- Partial sums of A051880.A050406
Partial sums of A051880.
- a(n) = n*(n^2 - 6*n + 11)/6.A050407
a(n) = n*(n^2 - 6*n + 11)/6.
- a(n) = (117*n^2 - 99*n + 2)/2.A050408
a(n) = (117*n^2 - 99*n + 2)/2.
- Truncated square pyramid numbers: a(n) = Sum_{k = n..2*n} k^2.A050409
Truncated square pyramid numbers: a(n) = Sum_{k = n..2*n} k^2.
- Truncated square pyramid numbers: a(n) = Sum_{k = n..2*n-1} k^2.A050410
Truncated square pyramid numbers: a(n) = Sum_{k = n..2*n-1} k^2.