This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A123640 #11 Jan 24 2024 07:57:18
%S A123640 0,1,0,1,1,0,1,1,0,1,0,0,1,1,1,1,1,0,1,1,0,0,0,0,1,1,1,1,1,1,1,1,0,1,
%T A123640 0,0,1,1,1,1,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,
%U A123640 0,0,0,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0
%N A123640 a(n) = A065120(n) modulo 2.
%C A123640 Previous name was: Consider the 2^n compositions of n per row and mark only those ending in an odd part.
%e A123640 A065120 begins 0, 1, 2, 1, 3, 2, 1, 1, 4, 3, 2, 2, 1, 1, 1, 1, ...
%e A123640 Therefore this sequence begins 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, ...
%o A123640 (PARI) lista(nn) = {my(v = vector(nn)); v[1] = 1; for (i=2, nn, v[i] = mg(i-1)*v[(i+1)\2];); for (i=1, nn, print1(valuation(v[i], 2) % 2, ", "););} \\ _Michel Marcus_, Feb 09 2014
%Y A123640 Cf. A001045, A065120, A123638, A123639, A123641.
%K A123640 easy,nonn
%O A123640 0,1
%A A123640 _Alford Arnold_, Oct 04 2006
%E A123640 More terms from _Nathaniel Johnston_, Apr 30 2011
%E A123640 New name using given formula, _Joerg Arndt_, Jan 24 2024