112632

Appears in sequences

• Number of binary Lyndon words containing n letters of each type; periodic binary sequences of period 2n with n zeros and n ones in each period.at n=12A022553
• Smallest multiple of n using all the digits of all its divisors (a permutation of the concatenation of its divisors), or 0 if no such number exists.at n=25A077351
• Molecular topological indices of the complete graph K_n.at n=38A181617
• Number of connected functions from {1,2,...,n} into a subset of {1,2,...,n} summed over all subsets.at n=6A216858
• Number of s in {1,...,n}^n having shortest run with the same value of length 3.at n=10A228622
• Number of right triangles on a centered hexagonal grid of size n.at n=9A241225
• Triangle read by rows: entries on or below the main diagonal in A245558.at n=77A245559
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) + 3, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=20A294544
• Numbers k such that k, k^2-1 and k^2+1 are all fine, where a number m is fine if its prime factors are all less than m^(1/3).at n=28A345896
• G.f. A(x) satisfies A(x) = 1 + x*A(x)*abs( 1/A(x)^2 ).at n=13A380710
• Triangle read by rows: T(n,k) is the number of 2n-bead balanced binary necklaces with period length 2n/k.at n=66A385666