|
| |
|
|
A065679
|
|
If n is even, a(n) = n^2 else a(n) = n.
|
|
2
| |
|
|
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; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=0,...,1000
|
|
|
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} ]
|
|
|
PROG
| (PARI) { for (n=0, 1000, if (n%2, a=n, a=n^2); write("b065679.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 26 2009]
|
|
|
CROSSREFS
| Cf. A065599.
Sequence in context: A010309 A169702 A077215 * A062776 A084471 A127675
Adjacent sequences: A065676 A065677 A065678 * A065680 A065681 A065682
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 03 2001
|
| |
|
|
