login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A168299 a(n) = 1 + 3^n * n^3. 1
1, 4, 73, 730, 5185, 30376, 157465, 750142, 3359233, 14348908, 59049001, 235782658, 918330049, 3502727632, 13124466937, 48427561126, 176319369217, 634465620820, 2259436291849, 7971951402154, 27894275208001, 96873331012984 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Numerator of 3^(-n) + n^3.

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

FORMULA

From R. J. Mathar, Nov 24 2009: (Start)

a(n) = 1 + A062074(n).

G.f.: (1 -9*x +87*x^2 -117*x^3 +54*x^4)/((1-x)*(3*x-1)^4). (End)

E.g.f.: exp(x) + 3*x*(1 + 9*x + 9*x^2)*exp(3*x). - G. C. Greubel, Jul 17 2016

MATHEMATICA

f[n_]:=3^n-n^3; Table[Numerator[f[n]], {n, 0, -50, -1}]

PROG

(MAGMA) [1+n^3*3^n: n in [0..30]]; // Vincenzo Librandi, Jul 02 2011

(PARI) for(n=0, 100, print1(1+(n^3)*(3^n), ", ")) \\ Edward Jiang, Nov 22 2013

CROSSREFS

Cf. A024026.

Sequence in context: A327112 A284673 A055556 * A089665 A092871 A222767

Adjacent sequences:  A168296 A168297 A168298 * A168300 A168301 A168302

KEYWORD

nonn,easy

AUTHOR

Vladimir Joseph Stephan Orlovsky, Nov 22 2009

EXTENSIONS

Corrected offset, and simplified the definition - R. J. Mathar, Nov 24 2009

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 14 17:44 EST 2019. Contains 329979 sequences. (Running on oeis4.)