login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A123640 Consider the 2^n compositions of n per row and mark only those ending in an odd part. 5
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

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

FORMULA

a(n) = Mod(A065120(n),2).

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: A096270 A159689 A174282 * A022924 A157412 A023532

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

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 18 07:01 EST 2018. Contains 317279 sequences. (Running on oeis4.)