22442

Appears in sequences

• Total sum of even parts in all partitions of n.at n=24A066966
• Indices of primes in sequence defined by A(0) = 13, A(n) = 10*A(n-1) + 33 for n > 0.at n=12A102023
• Number of equivalence classes of Boolean functions, that is, maps from GF(2)^n to GF(2), where maps f and g are equivalent iff one can be obtained from the other by a combination of (i) permuting the variables, (ii) complementing the variables, (iii) mapping f(x) to f(x) + b.x + c for a binary vector b and a binary scalar c.at n=4A109003
• Triangle of coefficients of polynomials u(n,x) jointly generated with A209696; see the Formula section.at n=51A209695
• Numbers with digits 2 and 4 only.at n=36A284920
• Consider the graph with one central vertex connected to three outer vertices (a star graph). Then, a(n) is the minimum number of moves required to transfer a stack of n pegs from one outer vertex to another outer vertex, moving pegs to adjacent vertices, following the rules of the Towers of Hanoi.at n=41A291876
• Number of integer partitions of n such that it is not possible to choose a different constant integer partition of each part.at n=38A387329