|
| |
| |
|
|
|
1, 3, 8, 17, 32, 57, 100, 177, 320, 593, 1124, 2169, 4240, 8361, 16580, 32993, 65792, 131361, 262468, 524649, 1048976, 2097593, 4194788, 8389137, 16777792, 33555057, 67109540, 134218457, 268436240
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
REFERENCES
| G. Everest, A. van der Poorten, I. Shparlinski and T. Ward, Recurrence Sequences, Amer. Math. Soc., 2003; see esp. p. 255.
P. R. Halmos, Problems for Mathematicians Young and Old. Math. Assoc. America, 1991, p. 179.
|
|
|
LINKS
| Vincenzo Librandi, Table of n, a(n) for n = 0..1000
|
|
|
FORMULA
| G.f.: (2*x-2*x^2+3*x^3-1)/(1-x)^3/(-1+2*x). a(n) = 2*A000217(n+1)+A000079(n) -3*A000027(n+1)+1. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 16 2007
|
|
|
MATHEMATICA
| f[n_]:=n^2+2^n; Table[f[n], {n, 0, 5!}] [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 05 2009]
|
|
|
PROG
| (MAGMA) [2^n+n^2: n in [0..35]]; // Vincenzo Librandi, Jun 07 2011
|
|
|
CROSSREFS
| Sequence in context: A105163 A011850 A141422 * A002625 A027181 A130750
Adjacent sequences: A001577 A001578 A001579 * A001581 A001582 A001583
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
