A123640 a(n) = A065120(n) modulo 2.

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

Offset

0,1

Comments

Previous name was: Consider the 2^n compositions of n per row and mark only those ending in an odd part.

Links

Table of n, a(n) for n=0..85.

Example

A065120 begins 0, 1, 2, 1, 3, 2, 1, 1, 4, 3, 2, 2, 1, 1, 1, 1, ...
Therefore this sequence begins 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, ...

Prog

(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

Crossrefs

Cf. A001045, A065120, A123638, A123639, A123641.

Sequence in context: A159689 A174282 A189301 * A022924 A295893 A157412

Adjacent sequences: A123637 A123638 A123639 * A123641 A123642 A123643

Keyword

easy,nonn

Author

Alford Arnold, Oct 04 2006

Extensions

More terms from Nathaniel Johnston, Apr 30 2011

New name using given formula, Joerg Arndt, Jan 24 2024

Status

approved