A024038 - OEIS

This site is supported by donations to The OEIS Foundation.

A024038

4^n-n^2.

1, 3, 12, 55, 240, 999, 4060, 16335, 65472, 262063, 1048476, 4194183, 16777072, 67108695, 268435260, 1073741599, 4294967040, 17179868895, 68719476412, 274877906583, 1099511627376, 4398046510663, 17592186043932 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,2`
	LINKS	`Vincenzo Librandi, Table of n, a(n) for n = 0..500` `Guo-Niu Han, Enumeration of Standard Puzzles`
	FORMULA	`a(n) = A000325(n)*A006127(n). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 10 2010]`
	PROG	`(MAGMA) [ 4^n-n^2: n in [0..30] ]; [From Vincenzo Librandi, Dec 25 2010]`
	CROSSREFS	`Cf. A000302, A000290. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 10 2010]` `Sequence in context: A052673 A180589 A042971 * A007199 A001764 A179848` `Adjacent sequences: A024035 A024036 A024037 * A024039 A024040 A024041`
	KEYWORD	`nonn,easy`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`

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

Last modified February 15 15:20 EST 2012. Contains 205823 sequences.