Sequences

Number of types of Boolean functions of n variables under a certain group.

Rectangular array of numbers Fibonacci(m(n+1))/Fibonacci(m), m >= 1, n >= 0, read by downward antidiagonals.

Numbers k such that k^2 + k + 1 is a palindrome.

Palindromes of form k^2 + k + 1.

Numerator of Sum_{k=1..n} 1/phi(k).

Primes p such that the decimal expansion of 1/p has a periodic part of even length.

Sum over all n! permutations of n elements of minimum lengths of cycles.

Sum over all n! permutations of n letters of maximum cycle length.

Congruence classes of triangles which can be drawn using lattice points in n X n grid as vertices.

Number of monomer-dimer tilings of n X n chessboard.

Triangle read by rows: T(n, k) = (k+1)*A132393(n+1, k+1), for 0 <= k <= n.

Number of ways n can be properly factored.

Clog sequence in base 2. Right to left concatenation of n,int(log_2(n)),int(log_2(int(log_2(n)))),... in base 2.

Clog sequence in base 3. Right to left concatenation of n,int(log_3(n)),int(log_3(int(log_3(n)))),... in base 3.

Clog sequence in base 4. Right to left concatenation of n, int(log_4(n)), int(log_4(int(log_4(n)))), ... in base 4.

Clog sequence in base 5. Right to left concatenation of n,int(log_5(n)),int(log_5(int(log_5(n)))),... in base5.

Clog sequence in base 6. Right to left concatenation of n,int(log_6(n)),int(log_6(int(log_6(n)))),... in base6.

Clog sequence in base 7. Right to left concatenation of n,int(log_7(n)),int(log_7(int(log_7(n)))),... in base7.

Clog sequence in base 8. Right to left concatenation of n, int(log_8(n)),int(log_8(int(log_8(n)))),... in base8.

Clog sequence in base 9. Right to left concatenation of n, int(log_9(n)), int(log_9(int(log_9(n)))),... in base9.

Clog sequence in base 10. Right to left concatenation of n, int(log_10(n)), int(log_10(int(log_10(n)))),... in base10.

Golc sequence in base 2. Left to right concatenation of n,int(log_2(n)),int(log_2(int(log_2(n)))),... in base 2.

Golc sequence in base 3. Left to right concatenation of n,int(log_3(n)),int(log_3(int(log_3(n)))),... in base 3.

Golc sequence in base 4. Left to right concatenation of n,int(log_4(n)),int(log_4(int(log_4(n)))),... in base 4.

Golc sequence in base 5. Left to right concatenation of n,int(log_5(n)),int(log_5(int(log_5(n)))),... in base5.

Golc sequence in base 6. Left to right concatenation of n,int(log_6(n)),int(log_6(int(log_6(n)))),... in base6.

Golc sequence in base 7. Left to right concatenation of n,int(log_7(n)),int(log_7(int(log_7(n)))),... in base7.

Golc sequence in base 8. Left to right concatenation of n,int(log_8(n)),int(log_8(int(log_8(n)))),... in base8.

Golc sequence in base 9. Left to right concatenation of n,int(log_9(n)),int(log_9(int(log_9(n)))),... in base9.

Golc sequence in base 10. Left to right concatenation of n,int(log_10(n)),int(log_10(int(log_10(n)))),... in base 10.

Triangulations of 4-dimensional cyclic polytopes.

Numbers k such that Mertens's function M(k) (A002321) is zero.

Erroneous version of A001108.

Busy Beaver sequence, or Rado's sigma function: maximal number of 1's that an n-state Turing machine can print on an initially blank tape before halting.

Number of cubefree words of length n on two letters.

Number of perfect matchings in graph P_{2n} X P_{2n} X P_{2n}.

Number of perfect matchings in graph P_{2} X P_{3} X P_{n}.

Number of perfect matchings in graph P_{2} X P_{4} X P_{n}.

Number of perfect matchings in graph P_{2} X P_{5} X P_{n}.

Number of perfect matchings in graph P_{2} X P_{6} X P_{n}.

Number of perfect matchings in graph P_{2} X P_{7} X P_{n}.

Number of perfect matchings in graph P_{3} X P_{3} X P_{2n}.

Number of perfect matchings in graph P_{3} X P_{4} X P_{n}.

Number of perfect matchings in graph P_{4} X P_{4} X P_{n}.

Number of perfect matchings in graph P_{2} X C_{3} X P_{n}.

Number of perfect matchings in graph P_{2} X C_{4} X P_{n}.

Number of perfect matchings in graph P_{2} X C_{5} X P_{n}.

Number of perfect matchings in graph P_{2} X C_{6} X P_{n}.

Number of perfect matchings in graph P_{2} X C_{7} X P_{n}.

Number of perfect matchings in graph P_{3} X C_{3} X P_{2n}.