Sequences
392,541 sequences
- n written efficiently in natural numbers base, i.e., in form ...wxyz where n = 1*z + 2*y + 3*x + 4*w + ... with z <= 1, y < 2, x < 3, w < 4, ...A055611
n written efficiently in natural numbers base, i.e., in form ...wxyz where n = 1*z + 2*y + 3*x + 4*w + ... with z <= 1, y < 2, x < 3, w < 4, ...
- a(n) = Product_{m=1..n} (binomial(n,m)+1).A055612
a(n) = Product_{m=1..n} (binomial(n,m)+1).
- n!*LaguerreL(n,4,-8).A055613
n!*LaguerreL(n,4,-8).
- Number of isomorphism classes of complex filiform Lie algebras of dimension n.A055614
Number of isomorphism classes of complex filiform Lie algebras of dimension n.
- a(n) = n * mu(n), where mu is the Möbius function A008683.A055615
a(n) = n * mu(n), where mu is the Möbius function A008683.
- Numbers, with an even number of digits, that are the sum of the squares of their two halves (leading zeros allowed only for the second half).A055616
Numbers, with an even number of digits, that are the sum of the squares of their two halves (leading zeros allowed only for the second half).
- a(n)= A*10^(3*n)+B with A=(10^(3*n)-10^n) and B=10^(2*n).A055617
a(n)= A*10^(3*n)+B with A=(10^(3*n)-10^n) and B=10^(2*n).
- a(n) = A*10^(4*n-1) + B with A = 990*(10^(4*n)-1)/9999 and B = 990000*(10^(4*n-4)-1)/9999 + 100.A055618
a(n) = A*10^(4*n-1) + B with A = 990*(10^(4*n)-1)/9999 and B = 990000*(10^(4*n-4)-1)/9999 + 100.
- a(n) = A*10^(4*n+1)+B with A=99000*(10^(4*n)-1)/9999+10 and B=9900*(10^(4*n)-1)/9999+1.A055619
a(n) = A*10^(4*n+1)+B with A=99000*(10^(4*n)-1)/9999+10 and B=9900*(10^(4*n)-1)/9999+1.
- Digits of an idempotent 6-adic number.A055620
Digits of an idempotent 6-adic number.
- Number of covers of an unlabeled n-set.A055621
Number of covers of an unlabeled n-set.
- Minimum solution for tri-color tower of Hanoi, restricted so like colors can't be together.A055622
Minimum solution for tri-color tower of Hanoi, restricted so like colors can't be together.
- First occurrence of run of primes congruent to 1 mod 4 of exactly length n.A055623
First occurrence of run of primes congruent to 1 mod 4 of exactly length n.
- First occurrence of run of primes congruent to 3 mod 4 of exactly length n.A055624
First occurrence of run of primes congruent to 3 mod 4 of exactly length n.
- First prime starting a chain of exactly n consecutive primes congruent to 1 modulo 6.A055625
First prime starting a chain of exactly n consecutive primes congruent to 1 modulo 6.
- First prime starting a chain of exactly n consecutive primes congruent to 5 modulo 6.A055626
First prime starting a chain of exactly n consecutive primes congruent to 5 modulo 6.
- From Vikram Seth's novel, "A Suitable Boy".A055627
From Vikram Seth's novel, "A Suitable Boy".
- Primes p whose period of the reciprocal 1/p is (p-1)/3.A055628
Primes p whose period of the reciprocal 1/p is (p-1)/3.
- Beginning of first run of at least n consecutive happy numbers.A055629
Beginning of first run of at least n consecutive happy numbers.
- Table T(k,m) = k^2 + m read by antidiagonals.A055630
Table T(k,m) = k^2 + m read by antidiagonals.
- Sum of Euler's totient function phi of distinct primes dividing n.A055631
Sum of Euler's totient function phi of distinct primes dividing n.
- Sum of totient function of primes dividing n is a prime.A055632
Sum of totient function of primes dividing n is a prime.
- Number of nested algorithms a(m,n) where m is the number of items in a contaminated group and n is the total number of unclassified items (0 <= m <= n) (values read by antidiagonals).A055633
Number of nested algorithms a(m,n) where m is the number of items in a contaminated group and n is the total number of unclassified items (0 <= m <= n) (values read by antidiagonals).
- 2-adic factorial function.A055634
2-adic factorial function.
- Smallest number that can be expressed as the sum of distinct Lucas numbers (A000204) in exactly n ways.A055635
Smallest number that can be expressed as the sum of distinct Lucas numbers (A000204) in exactly n ways.
- Partial sums of A144494.A055636
Partial sums of A144494.
- (n-1)!/n or 0 if n does not divide (n-1)!.A055637
(n-1)!/n or 0 if n does not divide (n-1)!.
- Numbers k for which sigma(k^2) is prime.A055638
Numbers k for which sigma(k^2) is prime.
- Number of nonzero digits of n which are not factors of n.A055639
Number of nonzero digits of n which are not factors of n.
- Number of nonzero digits in decimal expansion of n.A055640
Number of nonzero digits in decimal expansion of n.
- Number of zero digits in n.A055641
Number of zero digits in n.
- Number of digits in the decimal expansion of n.A055642
Number of digits in the decimal expansion of n.
- Babylonian numbers: integers in base 60 with each sexagesimal digit represented by 2 decimal digits, leading zeros omitted.A055643
Babylonian numbers: integers in base 60 with each sexagesimal digit represented by 2 decimal digits, leading zeros omitted.
- Integers in base 20 with each base 20 digit represented by 2 decimal digits.A055644
Integers in base 20 with each base 20 digit represented by 2 decimal digits.
- Integers in base 16 with each hexadecimal digit represented by 2 decimal digits.A055645
Integers in base 16 with each hexadecimal digit represented by 2 decimal digits.
- Integers in base 15 with each base 15 digit represented by 2 decimal digits.A055646
Integers in base 15 with each base 15 digit represented by 2 decimal digits.
- Integers in base 14 with each base 14 digit represented by 2 decimal digits.A055647
Integers in base 14 with each base 14 digit represented by 2 decimal digits.
- Integers in base 13 with each base 13 digit represented by 2 decimal digits.A055648
Integers in base 13 with each base 13 digit represented by 2 decimal digits.
- Integers in base 11 with each base-11 digit represented by 2 decimal digits.A055649
Integers in base 11 with each base-11 digit represented by 2 decimal digits.
- Numbers k such that k | phi(k)*d(k) - sigma(k), where phi=A000010, d=A000005 and sigma=A000203.A055650
Numbers k such that k | phi(k)*d(k) - sigma(k), where phi=A000010, d=A000005 and sigma=A000203.
- Table T(m,k)=m^k-k^m (with 0^0 taken to be 1) as square array read by antidiagonals.A055651
Table T(m,k)=m^k-k^m (with 0^0 taken to be 1) as square array read by antidiagonals.
- Table T(m,k)=m^k+k^m (with 0^0 taken to be 1) as square array read by antidiagonals.A055652
Table T(m,k)=m^k+k^m (with 0^0 taken to be 1) as square array read by antidiagonals.
- Sum of phi(d) [A000010] over all unitary divisors d of n (that is, gcd(d,n/d) = 1).A055653
Sum of phi(d) [A000010] over all unitary divisors d of n (that is, gcd(d,n/d) = 1).
- Difference between n and the result of "Phi-summation" over unitary divisors of n.A055654
Difference between n and the result of "Phi-summation" over unitary divisors of n.
- Efficient representation of n in "square base" where xyz means 9x+4y+z and z<4, y<9 and x<16 etc.A055655
Efficient representation of n in "square base" where xyz means 9x+4y+z and z<4, y<9 and x<16 etc.
- Excess in exponents of powers of 2 in Euler phi of n! compared to that of n!.A055656
Excess in exponents of powers of 2 in Euler phi of n! compared to that of n!.
- If a(n) is prime, a(n+1) = a(n) followed by a 1; if a(n) is composite, a(n+1) = concatenation of distinct prime factors of a(n).A055657
If a(n) is prime, a(n+1) = a(n) followed by a 1; if a(n) is composite, a(n+1) = concatenation of distinct prime factors of a(n).
- Number of (3,n)-partitions of a chain of length n^2.A055658
Number of (3,n)-partitions of a chain of length n^2.
- Number of (2,n)-partitions of a chain of length n^3.A055659
Number of (2,n)-partitions of a chain of length n^3.
- Number of (2,2; n,n)-partitions of a chain of length n^2 + n.A055660
Number of (2,2; n,n)-partitions of a chain of length n^2 + n.