Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036995
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036995 Triangle of numbers a(i,j), i+j = n >= 2, giving number of words in a certain language with i 0's, j 1's, ending with 1. +0
1
1, 1, 2, 1, 2, 3, 1, 3, 3, 4, 1, 3, 3, 5, 5, 1, 4, 4, 4, 7, 6, 1, 4, 5, 4, 7, 9, 7, 1, 5, 4, 7, 5, 9, 12, 8, 1, 5, 6, 6, 5, 10, 10, 15, 9, 1 (list; table; graph; listen)
OFFSET

0,3

REFERENCES

S. Dulucq and D. Gouyou-Beauchamps, Sur les facteurs des suites de Sturm, Theoret. Comput. Sci. 71 (1990), 381-400.

FORMULA

Th. 6.2 of the reference gives a generating function.

CROSSREFS

Adjacent sequences: A036992 A036993 A036994 this_sequence A036996 A036997 A036998

Sequence in context: A082076 A048793 A075106 this_sequence A116908 A072851 A103627

KEYWORD

nonn,easy,tabl,more

AUTHOR

njas

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 October 13 02:37 EDT 2008. Contains 145008 sequences.


AT&T Labs Research