Sequences
392,541 sequences
- Number of n-digit dihedral primes for which the 4 numbers (n, n upside-down, n in a mirror, n upside-down and mirrored) are distinct.A048661
Number of n-digit dihedral primes for which the 4 numbers (n, n upside-down, n in a mirror, n upside-down and mirrored) are distinct.
- Erroneous version of A134998.A048662
Erroneous version of A134998.
- Number of rooted polycubes with n cells, with no symmetries removed.A048663
Number of rooted polycubes with n cells, with no symmetries removed.
- Number of rooted 2-dimensional polyominoes with n square cells, with no symmetries removed.A048664
Number of rooted 2-dimensional polyominoes with n square cells, with no symmetries removed.
- Number of rooted 4-dimensional "polycubes" with n cells, with no symmetries removed.A048665
Number of rooted 4-dimensional "polycubes" with n cells, with no symmetries removed.
- Number of rooted 5-dimensional "polycubes" with n cells, with no symmetries removed.A048666
Number of rooted 5-dimensional "polycubes" with n cells, with no symmetries removed.
- Number of rooted 6-dimensional "polycubes" with n cells, with no symmetries removed.A048667
Number of rooted 6-dimensional "polycubes" with n cells, with no symmetries removed.
- Number of rooted 7-dimensional "polycubes" with n cells, with no symmetries removed.A048668
Number of rooted 7-dimensional "polycubes" with n cells, with no symmetries removed.
- The Jacobsthal function g(n): maximal gap in a list of all the integers relatively prime to n.A048669
The Jacobsthal function g(n): maximal gap in a list of all the integers relatively prime to n.
- Jacobsthal function A048669 applied to the product of the first n primes (A002110).A048670
Jacobsthal function A048669 applied to the product of the first n primes (A002110).
- a(n) is the least common multiple of the proper divisors of n.A048671
a(n) is the least common multiple of the proper divisors of n.
- Binary encoding of squarefree numbers (A005117): A048640(n)/2.A048672
Binary encoding of squarefree numbers (A005117): A048640(n)/2.
- Permutation of natural numbers: a(n) = (A003961(n)+1) / 2 [where A003961(n) shifts the prime factorization of n one step towards larger primes].A048673
Permutation of natural numbers: a(n) = (A003961(n)+1) / 2 [where A003961(n) shifts the prime factorization of n one step towards larger primes].
- Fixed points of A048673 and A064216: Numbers n such that if n = product_{k >= 1} (p_k)^(c_k), then Product_{k >= 1} (p_{k+1})^(c_k) = (2*n)-1, where p_k indicates the k-th prime, A000040(k).A048674
Fixed points of A048673 and A064216: Numbers n such that if n = product_{k >= 1} (p_k)^(c_k), then Product_{k >= 1} (p_{k+1})^(c_k) = (2*n)-1, where p_k indicates the k-th prime, A000040(k).
- If n = p_i^e_i * ... * p_k^e_k, p_i < ... < p_k primes (with p_i = prime(i)), then a(n) = (1/2) * (e_i * 2^i + ... + e_k * 2^k).A048675
If n = p_i^e_i * ... * p_k^e_k, p_i < ... < p_k primes (with p_i = prime(i)), then a(n) = (1/2) * (e_i * 2^i + ... + e_k * 2^k).
- Binary encoding of factorizations, alternative 2, a(n) = bef2(n);.A048676
Binary encoding of factorizations, alternative 2, a(n) = bef2(n);.
- Concatenation of first n palindromic primes.A048677
Concatenation of first n palindromic primes.
- Binary expansion of nonnegative integers expanded to "Zeckendorffian format" with rewrite rules 0->0, 1->01.A048678
Binary expansion of nonnegative integers expanded to "Zeckendorffian format" with rewrite rules 0->0, 1->01.
- Compressed fibbinary numbers (A003714), with rewrite 0->0, 01->1 applied to their binary expansion.A048679
Compressed fibbinary numbers (A003714), with rewrite 0->0, 01->1 applied to their binary expansion.
- Nonnegative integers A001477 expanded with rewrite 0->0, 01->1, then interpreted as Zeckendorffian expansions (as numbers of Fibonacci number system).A048680
Nonnegative integers A001477 expanded with rewrite 0->0, 01->1, then interpreted as Zeckendorffian expansions (as numbers of Fibonacci number system).
- Maximum over k of the largest squarefree number dividing a value of binomial(n,k).A048681
Maximum over k of the largest squarefree number dividing a value of binomial(n,k).
- a(n) is the difference between maximal and central squarefree kernel numbers dividing values of {binomial(n,k)} or A001405(n), respectively.A048682
a(n) is the difference between maximal and central squarefree kernel numbers dividing values of {binomial(n,k)} or A001405(n), respectively.
- Values of n for which the difference of maximal and central squarefree kernel numbers dividing values of {C(n,k)} or A001405(n) is zero.A048683
Values of n for which the difference of maximal and central squarefree kernel numbers dividing values of {C(n,k)} or A001405(n) is zero.
- Multiplicity of the maximum squarefree kernel function applied to the binomial coefficients C(n,k).A048684
Multiplicity of the maximum squarefree kernel function applied to the binomial coefficients C(n,k).
- a(n) is the number of times the maximum value of Omega(binomial(n, k)) occurs in the n-th row of Pascal's triangle, where Omega(n) is the number of prime divisors of n counted with multiplicity (A001222).A048685
a(n) is the number of times the maximum value of Omega(binomial(n, k)) occurs in the n-th row of Pascal's triangle, where Omega(n) is the number of prime divisors of n counted with multiplicity (A001222).
- Number of classes generated by function A007947 when applied to binomial coefficients.A048686
Number of classes generated by function A007947 when applied to binomial coefficients.
- a(n) is the number of classes generated by function A001221 when applied to binomial coefficients.A048687
a(n) is the number of classes generated by function A001221 when applied to binomial coefficients.
- Number of classes generated by function A000005 when applied to binomial coefficients.A048688
Number of classes generated by function A000005 when applied to binomial coefficients.
- Number of classes generated by function A001222 when applied to binomial coefficients.A048689
Number of classes generated by function A001222 when applied to binomial coefficients.
- Erroneous version of A006045 (I think!).A048690
Erroneous version of A006045 (I think!).
- a(n) = d(n^2), where d(k) = A000005(k) is the number of divisors of k.A048691
a(n) = d(n^2), where d(k) = A000005(k) is the number of divisors of k.
- Triangle read by rows in which row n contains first n numbers with exactly n distinct prime factors.A048692
Triangle read by rows in which row n contains first n numbers with exactly n distinct prime factors.
- Generalized Pellian with 2nd term equal to 6.A048693
Generalized Pellian with 2nd term equal to 6.
- Generalized Pellian with second term equal to 7.A048694
Generalized Pellian with second term equal to 7.
- Generalized Pellian with second term equal to 8.A048695
Generalized Pellian with second term equal to 8.
- Generalized Pellian with second term equal to 9.A048696
Generalized Pellian with second term equal to 9.
- Generalized Pellian with second term equal to 10.A048697
Generalized Pellian with second term equal to 10.
- Nonprime numbers k such that sum of aliquot divisors of k is a cube.A048698
Nonprime numbers k such that sum of aliquot divisors of k is a cube.
- Nonprime numbers whose sum of aliquot divisors (A001065) is a perfect square.A048699
Nonprime numbers whose sum of aliquot divisors (A001065) is a perfect square.
- Binary palindromes of odd length (written in base 10).A048700
Binary palindromes of odd length (written in base 10).
- List of binary palindromes of even length (written in base 10).A048701
List of binary palindromes of even length (written in base 10).
- Binary palindromes of even length divided by 3.A048702
Binary palindromes of even length divided by 3.
- Numbers which in base 4 are palindromes and have an even number of digits.A048703
Numbers which in base 4 are palindromes and have an even number of digits.
- Base 4 palindromes of even length divided by 5. a(n) = A048703(n)/5.A048704
Base 4 palindromes of even length divided by 5. a(n) = A048703(n)/5.
- The rule numbers for 1-D CA composed of Rules "90" and "150" so that each direction occurs only once.A048705
The rule numbers for 1-D CA composed of Rules "90" and "150" so that each direction occurs only once.
- XOR-conjugate rules of 1-D cellular automata rules given in A048705.A048706
XOR-conjugate rules of 1-D cellular automata rules given in A048705.
- Numerators of ratios converging to Thue-Morse constant.A048707
Numerators of ratios converging to Thue-Morse constant.
- Numerators of ratios converging to the Thue-Morse constant, converted to hexadecimal.A048708
Numerators of ratios converging to the Thue-Morse constant, converted to hexadecimal.
- Main diagonal of Family 1 "Rule 90 x Rule 150" array.A048709
Main diagonal of Family 1 "Rule 90 x Rule 150" array.
- Family 1 "Rule 90 x Rule 150 Array" read by antidiagonals.A048710
Family 1 "Rule 90 x Rule 150 Array" read by antidiagonals.