id:A026817 - OEIS Search Results

Search: id:A026817

Displaying 1-1 of 1 results found.

page 1

Number of sets which can be obtained by selecting unique elements from two sets with 2n and 3n elements respectively and n common elements.

+0
2

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; listen)

	OFFSET	`1,1`
	COMMENT	`Essentially identical to A022269. - R. J. Mathar, May 28 2008`
	FORMULA	`a(n)=(11*n^2+n)/2`
	EXAMPLE	`n=1: 2n=2, 3n=3, a(1)=6`
	CROSSREFS	`Sequence in context: A081097 A031293 A022269 this_sequence A009017 A119712 A005745` `Adjacent sequences: A026814 A026815 A026816 this_sequence A026818 A026819 A026820`
	KEYWORD	`nonn`
	AUTHOR	`Dolmatov S. (aalma(AT)mail.ru), Jun 24 2003`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research