login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026817 Number of sets which can be obtained by selecting unique elements from two sets with 2n and 3n elements respectively and n common elements. 1
6, 23, 51, 90, 140, 201, 273, 356, 450, 555, 671, 798, 936, 1085, 1245, 1416, 1598, 1791, 1995, 2210, 2436, 2673, 2921, 3180, 3450, 3731, 4023, 4326, 4640, 4965, 5301, 5648, 6006, 6375, 6755, 7146, 7548, 7961, 8385, 8820, 9266, 9723, 10191, 10670 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Essentially identical to A022269. - R. J. Mathar, May 28 2008

FORMULA

a(n)=(11*n^2+n)/2

G.f.: x(6+5x)/(1-x)^3. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 23 2008]

EXAMPLE

n=1: 2*n=2, 3*n=3, a(1)=6

CROSSREFS

Sequence in context: A081097 A031293 A022269 * A189713 A162267 A009017

Adjacent sequences:  A026814 A026815 A026816 * A026818 A026819 A026820

KEYWORD

nonn

AUTHOR

Dolmatov S. (aalma(AT)mail.ru), Jun 24 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 04:18 EST 2012. Contains 205860 sequences.