Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A047909
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A047909 Triangle of numbers arising from problem of complete increasing subsequences. +0
5
1, 1, 1, 1, 5, 1, 1, 19, 47, 1, 1, 69, 1306, 641, 1, 1, 251, 31451, 195709, 2619, 1, 1, 923, 729811, 46922016 (list; table; graph; listen)
OFFSET

1,5

REFERENCES

J. D. Horton and A. Kurn, Counting sequences with complete increasing subsequences, Congress Numerantium, 33 (1981), 75-80.

FORMULA

Reference gives explicit formula.

CROSSREFS

Row 2 is A006902. Column 2 is A030662.

Sequence in context: A029847 A154334 A144397 this_sequence A111577 A036969 A080249

Adjacent sequences: A047906 A047907 A047908 this_sequence A047910 A047911 A047912

KEYWORD

tabl,nonn,easy,nice,more

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research