Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A127830
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A127830 a(n)=sum{k=0..n, mod(C(floor(k/2),n-k),2)}. +0
2
1, 1, 1, 2, 2, 1, 2, 3, 3, 3, 2, 2, 3, 2, 3, 5, 5, 4, 4, 5, 4, 3, 3, 3, 4, 4, 3, 4, 5, 3, 5, 8, 8, 7, 6, 7, 7, 5, 6, 8, 7, 6, 5, 5, 5, 4, 4, 5, 6, 5, 5, 7, 6, 4, 5, 6, 7, 7, 5, 6, 8, 5, 8, 13, 13, 11, 10, 12, 11, 8, 9, 11, 11, 10, 8, 9, 10, 7, 9, 13, 12 (list; graph; listen)
OFFSET

0,4

COMMENT

Row sums of number triangle A127829.

FORMULA

a(2^n)=F(n); a(2^(n+1)+1)=L(n); a(n) mod 2=A000931(n+5) mod 2=A011656(n+4);

CROSSREFS

Sequence in context: A131730 A029335 A029257 this_sequence A053284 A050371 A022871

Adjacent sequences: A127827 A127828 A127829 this_sequence A127831 A127832 A127833

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Feb 01 2007

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 September 6 00:03 EDT 2008. Contains 143485 sequences.


AT&T Labs Research