63075
domain: N
Appears in sequences
- Numbers k such that sigma(reverse(k)) = sigma(reverse(k-1)) + sigma(reverse(k-2)).at n=21A069970
- Numbers n that are the hypotenuse of exactly 12 distinct integer-sided right triangles, i.e., n^2 can be written as a sum of two squares in 12 ways.at n=23A097226
- Integers n not of form 3m+2 such that for any integer k > 0, n*10^k+1 has a divisor in the set { 7, 11, 13, 37 }.at n=13A243969
- Number of length n+7 0..2 arrays with at most one downstep in every n consecutive neighbor pairs.at n=7A255114
- G.f.: Product_{k>=1} 1/(1-x^k)^(3*k+1).at n=10A255271
- a(n) is the sum over all partitions of n of the number of right angles that are not the largest right angle.at n=37A330378