login
a(n) = floor(n*e) mod 2.
2

%I #25 Jul 05 2024 06:59:51

%S 0,1,0,0,1,0,1,1,0,1,1,0,1,0,0,1,0,0,1,0,1,1,0,1,1,0,1,0,0,1,0,0,1,0,

%T 1,1,0,1,0,0,1,0,0,1,0,1,1,0,1,1,0,1,0,0,1,0,0,1,0,1,1,0,1,1,0,1,0,0,

%U 1,0,0,1,0,1,1,0,1,0,0,1,0,0,1,0,1,1,0,1,1,0

%N a(n) = floor(n*e) mod 2.

%H Paolo Xausa, <a href="/A372544/b372544.txt">Table of n, a(n) for n = 1..10000</a>

%H Peter Borwein and Loki Jörgenson, <a href="https://doi.org/10.1080/00029890.2001.11919824">Visible Structures in Number Theory</a>, The American Mathematical Monthly, Vol. 108, 2001, No. 10, pp. 906-908.

%H Paolo Xausa, <a href="/A372544/a372544_1.png">First 6400 terms in a square array</a> (cf. Figure 10 in Borwein and Jörgenson paper).

%F a(n) = A000035(A022843(n)). - _Michel Marcus_, Jul 05 2024

%t Mod[Floor[E*Range[100]], 2]

%Y Cf. A000035, A022843, A001113, A115788.

%K nonn

%O 1

%A _Paolo Xausa_, Jul 04 2024