id:A065679 - OEIS Search Results

Search: id:A065679

Displaying 1-1 of 1 results found.

page 1

If n is even, a(n) = n^2 else a(n) = n.

+0
1

0, 1, 4, 3, 16, 5, 36, 7, 64, 9, 100, 11, 144, 13, 196, 15, 256, 17, 324, 19, 400, 21, 484, 23, 576, 25, 676, 27, 784, 29, 900, 31, 1024, 33, 1156, 35, 1296, 37, 1444, 39, 1600, 41, 1764, 43, 1936, 45, 2116, 47, 2304, 49, 2500, 51, 2704, 53, 2916, 55, 3136, 57 (list; graph; listen)

	OFFSET	`0,3`
	FORMULA	`n^{ n+1 (Modulo 2) + 1}` `O.g.f.: x(1+x^2)(1+4x-x^2)/(1-x^2)^3. - Len Smiley (smiley(AT)math.uaa.alaska.edu), Dec 05 2001`
	MATHEMATICA	`Table[ n^ (Mod[n + 1, 2] + 1), {n, 0, 60} ]`
	CROSSREFS	`Cf. A065599.` `Adjacent sequences: A065676 A065677 A065678 this_sequence A065680 A065681 A065682` `Sequence in context: A113204 A010309 A077215 this_sequence A062776 A084471 A127675`
	KEYWORD	`easy,nonn`
	AUTHOR	`Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 03 2001`

page 1

Search completed in 0.002 seconds

Last modified October 6 16:13 EDT 2008. Contains 144667 sequences.

AT&T Labs Research