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; internal format)
OFFSET

0,1

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, ...

CROSSREFS

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

Sequence in context: A096270 A159689 A174282 * A022924 A144612 A157412

Adjacent sequences:  A123637 A123638 A123639 * A123641 A123642 A123643

KEYWORD

easy,nonn

AUTHOR

Alford Arnold (Alford1940(AT)aol.com), Oct 04 2006

EXTENSIONS

More terms from Nathaniel Johnston (nathaniel(AT)nathanieljohnston.com), Apr 30 2011

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

Content is available under The OEIS End-User License Agreement .

Last modified February 14 18:47 EST 2012. Contains 205663 sequences.