36575

Appears in sequences

• At stage 1, start with a unit square. At each successive stage add 4*(n-1) new squares around outside with edge-to-edge contacts. Sequence gives number of squares (regardless of size) at n-th stage.at n=37A056640
• Triangle T = A007318*A271703; T(n,m)= Sum_{i=0..n} L'(n,i)*binomial(i,m), m=0..n.at n=31A059110
• Number of squares in the interior of the square with vertices (n,0), (0,n), (-n,0) and (0,-n) in a square (x,y)-grid.at n=37A111746
• a(n) = E(k)*C(n+k,k) = Euler(k)*binomial(n+k,k) for k=4.at n=18A154286
• Number of (n+5) X 8 0..1 matrices with each 6 X 6 subblock idempotent.at n=13A224572
• First occurrence of n in A225399, or -1 if n does not appear in A225399.at n=33A225400
• a(n) = binomial(floor(n/2),4) + (ceiling(n/2)-3)*binomial(floor(n/2),3).at n=44A234277
• Occurrences of decrease of the probability density P(n) of coprime numbers k,m, satisfying 1 <= k <= a(n) and 1 <= m <= a(n), and a(n) congruent to 1 (mod 2) and a(n) not congruent to 3 (mod 6).at n=13A280879
• E.g.f. A(x) satisfies: 1 = Sum_{n>=0} 2^n * (exp(n*x) - A(x))^n / n!.at n=5A353739
• Index of the first occurrence of n in A076982.at n=34A368855
• a(n) is the smallest number which can be represented as the sum of 4 distinct nonzero tetrahedral numbers in exactly n ways, or -1 if no such number exists.at n=27A374809
• Numbers k such that k and k+1 have an equal sum of modified exponential divisors: A241405(k) = A241405(k+1).at n=29A379032
• Triangle read by rows: T(n,d) is the number of free (d,2)-polyominoids of size n, 2 <= d <= n+1.at n=19A387003