A372544 - OEIS

A372544

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

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, 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, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0

(list; graph; refs; listen; history; text; internal format)

OFFSET

LINKS

Paolo Xausa, Table of n, a(n) for n = 1..10000

Peter Borwein and Loki Jörgenson, Visible Structures in Number Theory, The American Mathematical Monthly, Vol. 108, 2001, No. 10, pp. 906-908.

Paolo Xausa, First 6400 terms in a square array (cf. Figure 10 in Borwein and Jörgenson paper).

FORMULA

a(n) = A000035(A022843(n)). - Michel Marcus, Jul 05 2024

MATHEMATICA

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

CROSSREFS

Cf. A000035, A022843, A001113, A115788.