Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A027798
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A027798 26*(n+1)*C(n+3,13). +0
1
286, 4368, 35490, 203840, 928200, 3564288, 11992344, 36279360, 100524060, 258658400, 624660036, 1427794368, 3109779400, 6489974400, 13037895000, 25310900160, 47640468330, 87185170800, 155514818550, 270951408000 (list; graph; listen)
OFFSET

0,1

FORMULA

Number of 17-subsequences of [ 1, n ] with just 3 contiguous pairs; g.f. 26*(11+3x)/(1-x)^15

C(n+11, 11)*C(n+13, 3) - Zerinvary Lajos (zlaja(AT)freemail.hu), May 10 2005

CROSSREFS

Sequence in context: A105921 A090089 A025384 this_sequence A072817 A117994 A130433

Adjacent sequences: A027795 A027796 A027797 this_sequence A027799 A027800 A027801

KEYWORD

nonn

AUTHOR

thi ngoc dinh (via rkg(AT)cpsc.ucalgary.ca)

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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research