Sequences
392,541 sequences
- Enumeration of natural numbers by the boustrophedonic diagonal method.A056011
Enumeration of natural numbers by the boustrophedonic diagonal method.
- Numbers n such that n | Sigma(n) + d(n) + Phi(n).A056012
Numbers n such that n | Sigma(n) + d(n) + Phi(n).
- Numbers n such that n | sigma(n) - d(n) + phi(n).A056013
Numbers n such that n | sigma(n) - d(n) + phi(n).
- a(n) = (Fibonacci(2n-1) - Fibonacci(n+1))/2.A056014
a(n) = (Fibonacci(2n-1) - Fibonacci(n+1))/2.
- a(n) = 6*a(n-1) - 5*a(n-2) - 4*a(n-3) - 3*a(n-4) + 2*a(n-5) + a(n-6), with a(0)=...=a(4)=0, a(5)=1.A056015
a(n) = 6*a(n-1) - 5*a(n-2) - 4*a(n-3) - 3*a(n-4) + 2*a(n-5) + a(n-6), with a(0)=...=a(4)=0, a(5)=1.
- a(n) = -2*a(n - 1) -a(n - 2) -a(n - 3), a(0) = a(1) = a(2) = 1.A056016
a(n) = -2*a(n - 1) -a(n - 2) -a(n - 3), a(0) = a(1) = a(2) = 1.
- Permutation of nonnegative integers formed by ranking fibbinary numbers (A003714) as if they were representatives of the circular binary sequences with forbidden -11- subsequence.A056017
Permutation of nonnegative integers formed by ranking fibbinary numbers (A003714) as if they were representatives of the circular binary sequences with forbidden -11- subsequence.
- Inverse permutation to A056017.A056018
Inverse permutation to A056017.
- Self-inverse infinite permutation which shows the position of each finite permutation's inverse permutation in A055089.A056019
Self-inverse infinite permutation which shows the position of each finite permutation's inverse permutation in A055089.
- Numbers that are congruent to +-1 mod 9.A056020
Numbers that are congruent to +-1 mod 9.
- Numbers k such that k^4 == 1 (mod 5^2).A056021
Numbers k such that k^4 == 1 (mod 5^2).
- Numbers k such that k^6 == 1 (mod 7^2).A056022
Numbers k such that k^6 == 1 (mod 7^2).
- The positive integers written as a triangle, where row n is written from right to left if n is odd and otherwise from left to right.A056023
The positive integers written as a triangle, where row n is written from right to left if n is odd and otherwise from left to right.
- Numbers k such that k^10 == 1 (mod 11^2).A056024
Numbers k such that k^10 == 1 (mod 11^2).
- Numbers k such that k^12 == 1 (mod 13^2).A056025
Numbers k such that k^12 == 1 (mod 13^2).
- Numbers k such that k^14 == 1 (mod 15^2).A056026
Numbers k such that k^14 == 1 (mod 15^2).
- Numbers k such that k^16 == 1 (mod 17^2).A056027
Numbers k such that k^16 == 1 (mod 17^2).
- Numbers k such that k^18 == 1 (mod 19^2).A056028
Numbers k such that k^18 == 1 (mod 19^2).
- Champernowne's constant in base 2.A056029
Champernowne's constant in base 2.
- Continued fraction for 0.12112111211112... .A056030
Continued fraction for 0.12112111211112... .
- Numbers k such that k^22 == 1 (mod 23^2).A056031
Numbers k such that k^22 == 1 (mod 23^2).
- Trimorphic but not bimorphic nor automorphic.A056032
Trimorphic but not bimorphic nor automorphic.
- 5-morphic but not bimorphic nor automorphic.A056033
5-morphic but not bimorphic nor automorphic.
- Numbers k such that k^28 == 1 (mod 29^2).A056034
Numbers k such that k^28 == 1 (mod 29^2).
- Numbers k such that k^30 == 1 (mod 31^2).A056035
Numbers k such that k^30 == 1 (mod 31^2).
- 5-morphic but not bimorphic, automorphic nor trimorphic.A056036
5-morphic but not bimorphic, automorphic nor trimorphic.
- Number of 6 X 6 binary matrices with n ones, with no zero rows or columns, up to row and column permutation.A056037
Number of 6 X 6 binary matrices with n ones, with no zero rows or columns, up to row and column permutation.
- Largest factorial k! such that (k!)^2 divides n!.A056038
Largest factorial k! such that (k!)^2 divides n!.
- Largest k such that (k!)^2 divides n!.A056039
Largest k such that (k!)^2 divides n!.
- Swinging factorial, a(n) = 2^(n-(n mod 2))*Product_{k=1..n} k^((-1)^(k+1)).A056040
Swinging factorial, a(n) = 2^(n-(n mod 2))*Product_{k=1..n} k^((-1)^(k+1)).
- Value for which b(a(n))=0 when b(2)=n and b(k+1) is calculated by writing b(k) in base k, reading this as being written in base k+1 and then subtracting 1.A056041
Value for which b(a(n))=0 when b(2)=n and b(k+1) is calculated by writing b(k) in base k, reading this as being written in base k+1 and then subtracting 1.
- a(n) = n!/(k!)^2, where k is the largest number such that (k!)^2 divides n!.A056042
a(n) = n!/(k!)^2, where k is the largest number such that (k!)^2 divides n!.
- Let k be largest number such that k^2 divides n!; a(n) = k/floor(n/2)!.A056043
Let k be largest number such that k^2 divides n!; a(n) = k/floor(n/2)!.
- Let k be the largest number such that k^2 divides n! and let m be the largest number such that m!^2 divides n!; a(n) = k/m!.A056044
Let k be the largest number such that k^2 divides n! and let m be the largest number such that m!^2 divides n!; a(n) = k/m!.
- a(n) = Sum_{d|n} binomial(n,d).A056045
a(n) = Sum_{d|n} binomial(n,d).
- Number of 3-antichain covers of a labeled n-set.A056046
Number of 3-antichain covers of a labeled n-set.
- Number of 4-antichain covers of a labeled n-set.A056047
Number of 4-antichain covers of a labeled n-set.
- Number of 5-antichain covers of a labeled n-set.A056048
Number of 5-antichain covers of a labeled n-set.
- Number of 6-antichain covers of a labeled n-set.A056049
Number of 6-antichain covers of a labeled n-set.
- Semimorphic numbers: n^2 mod the number of digits in n = n^3 mod the number of digits in n.A056050
Semimorphic numbers: n^2 mod the number of digits in n = n^3 mod the number of digits in n.
- a(n) = (n-2)! - 1 (mod n).A056051
a(n) = (n-2)! - 1 (mod n).
- Number of 7-antichain covers of a labeled n-set.A056052
Number of 7-antichain covers of a labeled n-set.
- a(n) = smallest odd number 2m+1 such that the partial sum of the odd harmonic series Sum_{j=0..m} 1/(2j+1) is > n.A056053
a(n) = smallest odd number 2m+1 such that the partial sum of the odd harmonic series Sum_{j=0..m} 1/(2j+1) is > n.
- a(n) = smallest even number 2m such that value of odd harmonic series Sum_{j=0..m} 1/(2j) is > n.A056054
a(n) = smallest even number 2m such that value of odd harmonic series Sum_{j=0..m} 1/(2j) is > n.
- Integers k > 1 such that the decimal expansion of 1/k contains k as a string. (If the decimal expansion terminates, trailing zeros do not count.)A056055
Integers k > 1 such that the decimal expansion of 1/k contains k as a string. (If the decimal expansion terminates, trailing zeros do not count.)
- Square root of largest square dividing n-th central binomial coefficient.A056056
Square root of largest square dividing n-th central binomial coefficient.
- The largest square which divides n-th central binomial coefficient.A056057
The largest square which divides n-th central binomial coefficient.
- Squarefree part of the n-th central binomial coefficient.A056058
Squarefree part of the n-th central binomial coefficient.
- GCD of largest square and squarefree part of central binomial coefficients.A056059
GCD of largest square and squarefree part of central binomial coefficients.
- The powerfree part of the central binomial coefficients.A056060
The powerfree part of the central binomial coefficients.