Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A117671
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A117671 C(3*n+1,n+1) +0
1
1, 6, 35, 210, 1287, 8008, 50388, 319770, 2042975, 13123110, 84672315, 548354040, 3562467300, 23206929840, 151532656696, 991493848554, 6499270398159, 42671977361650, 280576272201225 (list; graph; listen)
OFFSET

0,2

LINKS

Milan Janjic, Two Enumerative Functions

EXAMPLE

if n=0 then C(3*0+1,0+1)= C(1,1)=1

if n=10 then C(3*10+1,10+1)= C(31,11)=84672315

CROSSREFS

Sequence in context: A121838 A001109 A144638 this_sequence A000399 A081051 A145145

Adjacent sequences: A117668 A117669 A117670 this_sequence A117672 A117673 A117674

KEYWORD

easy,nonn

AUTHOR

Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 12 2006

page 1

Search completed in 0.004 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 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research