id:A111587 - OEIS Search Results

Search: id:A111587

Displaying 1-1 of 1 results found.

page 1

a(n) = 2*a(n-1) + 2*a(n-3) + a(n-4), a(0) = 1, a(1) = 4, a(2) = 9, a(3) = 20.

+0
1

1, 4, 9, 20, 49, 120, 289, 696, 1681, 4060, 9801, 23660, 57121, 137904, 332929, 803760, 1940449, 4684660, 11309769, 27304196, 65918161, 159140520, 384199201, 927538920, 2239277041, 5406093004, 13051463049, 31509019100, 76069501249 (list; graph; listen)

	OFFSET	`0,2`
	FORMULA	`a(2n) = A090390(n+1), a(2n+1) = A046729(n+1); G.f. (x+1)^2/((x^2+1)(x^2+2x-1))`
	PROGRAM	`Floretion Algebra Multiplication Program, FAMP Code: 2kbasekseq[J+G] with J = + j' + k' + 'ii' and G = + .5'ii' + .5'jj' + .5'kk' + .5e`
	CROSSREFS	`Cf. A090390, A046729, A111588, A019898.` `Sequence in context: A020708 A109110 A108870 this_sequence A130045 A147971 A038805` `Adjacent sequences: A111584 A111585 A111586 this_sequence A111588 A111589 A111590`
	KEYWORD	`easy,nonn`
	AUTHOR	`Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Aug 08 2005`

page 1

Search completed in 0.002 seconds

Last modified November 30 22:12 EST 2008. Contains 150989 sequences.

AT&T Labs Research