Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A095090
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A095090 Number of 4k+3 integers in range ]2^n,2^(n+1)] whose Jacobi-vector is a Motzkin-path (A095100). +0
4
1, 1, 2, 3, 6, 9, 17, 33, 60, 108, 202, 360, 703, 1328, 2519, 4779, 9103, 17501, 33473, 64761 (list; graph; listen)
OFFSET

1,3

LINKS

A. Karttunen and J. Moyer, C-program for computing the initial terms of this sequence

CROSSREFS

a(n) = (2^(n-2))-A095091(n) for n > 1. Cf. A095092.

Sequence in context: A073776 A129853 A095982 this_sequence A061947 A018251 A018402

Adjacent sequences: A095087 A095088 A095089 this_sequence A095091 A095092 A095093

KEYWORD

nonn

AUTHOR

Antti Karttunen (his-firstname.his-surname(AT)iki.fi) and Jun 01 2004

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 December 4 12:48 EST 2009. Contains 170310 sequences.


AT&T Labs Research