Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A123640
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A123640 Consider the 2^n compositions of n per row and mark only those ending in an odd part. +0
6
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 (list; graph; listen)
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: A165211 A096270 A159689 this_sequence A022924 A144612 A157412

Adjacent sequences: A123637 A123638 A123639 this_sequence A123641 A123642 A123643

KEYWORD

easy,more,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research