37004

Appears in sequences

• a(n) = floor(10000*log_2(n)).at n=12A004268
• a(n) = round(10000*log_2(n)).at n=12A004269
• Product of n with sum of next n consecutive integers.at n=28A036659
• Number of perfect matchings in triangle graph with n nodes per side.at n=8A039907
• Number of perfect matchings in triangle graph with n nodes per side as n runs through numbers congruent to 0 or 3 mod 4.at n=4A071093
• Number of perfect matchings in the n X n X n triangular grid, reduced by the spire vertex if n mod 4 equals 1 or 2.at n=8A178446
• Number of (w,x,y,z) with all terms in {1,...,n} and 2|w-x|>=n+|y-z|.at n=23A212688
• Total number of smallest parts in all partitions of n minus the total number of smallest parts that are also emergent parts in all partitions of n with at least one distinct part.at n=31A220489
• Number of ways to reciprocally link elements of an n X n X n triangular array with themselves or a neighbor, with no more than 1 elements linked to themselves.at n=7A271610
• T(n,k) = Number of ways to reciprocally link elements of an n X n X n triangular array with themselves or a neighbor, with no more than k elements linked to themselves.at n=35A271617
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 813", based on the 5-celled von Neumann neighborhood.at n=30A273640
• a(n) = floor( Sum_{k>=0} n^(k*Phi) / Gamma(k*Phi + 1) ), where Gamma(x) is Euler's gamma function and Phi = (sqrt(5) + 1)/2 is the golden ratio.at n=11A326804
• Number of ways to write n as an ordered sum of 8 primes (counting 1 as a prime).at n=18A341987
• Positions k where A348733(k) is not multiplicative.at n=41A348740