227968
domain: N
Appears in sequences
- Number of solutions to Nickerson variant of Langford (or Langford-Skolem) problem.at n=11A059106
- Number of solutions to Nickerson variant of Langford (or Langford-Skolem) problem, as n runs through the positive numbers congruent to 0 or 1 mod 4.at n=5A268535
- G.f. A(x,y) satisfies: A(x,y) = x*y + A(x,x*y)^2, with A(0,y) = 1.at n=69A275670