Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A095091
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A095091
%S A095091 0,0,0,1,2,7,15,31,68,148,310,664,1345,2768,5673,11605,23665,48035,
%T A095091 97599,197383
%N A095091 Number of 4k+3 integers in range ]2^n,2^(n+1)] whose Jacobi-vector is 
               not a valid Motzkin-path (A095101).
%H A095091 A. Karttunen and J. Moyer, <a href="a095062.c.txt">C-program for computing 
               the initial terms of this sequence</a>
%Y A095091 a(n) = (2^(n-2))-A095090(n) for n > 1. Cf. A095093.
%Y A095091 Sequence in context: A003452 A000148 A147672 this_sequence A131412 A151998 
               A052130
%Y A095091 Adjacent sequences: A095088 A095089 A095090 this_sequence A095092 A095093 
               A095094
%K A095091 nonn
%O A095091 1,5
%A A095091 Antti Karttunen (his-firstname.his-surname(AT)iki.fi) and Jun 01 2004

    
page 1

Search completed in 0.008 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 5 23:38 EST 2009. Contains 170428 sequences.


AT&T Labs Research