login

Revision History for A074515

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
a(n) = 1^n + 4^n + 9^n.
(history; published version)
#23 by Michel Marcus at Sun Mar 14 12:07:26 EDT 2021
STATUS

reviewed

approved

#22 by Joerg Arndt at Sun Mar 14 12:06:23 EDT 2021
STATUS

proposed

reviewed

#21 by Michel Marcus at Sun Mar 14 11:50:33 EDT 2021
STATUS

editing

proposed

#20 by Michel Marcus at Sun Mar 14 11:50:27 EDT 2021
LINKS

<a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (14,-49,36).

STATUS

proposed

editing

#19 by Michael S. Branicky at Sun Mar 14 11:44:56 EDT 2021
STATUS

editing

proposed

#18 by Michael S. Branicky at Sun Mar 14 11:43:03 EDT 2021
PROG

(Python)

def a(n): return 1 + 4**n + 9**n

print([a(n) for n in range(19)]) # Michael S. Branicky, Mar 14 2021

STATUS

approved

editing

#17 by Susanna Cuyler at Sun Jan 14 23:06:14 EST 2018
STATUS

proposed

approved

#16 by Jon E. Schoenfield at Sun Jan 14 20:47:51 EST 2018
STATUS

editing

proposed

#15 by Jon E. Schoenfield at Sun Jan 14 20:47:48 EST 2018
NAME

a(n) = 1^n + 4^n + 9^n.

FORMULA

From Mohammad K. Azarian, Dec 26 2008: (Start)

G.f.: 1/(1-x) + 1/(1-4*x) + 1/(1-9*x). E.g.f.: e^x+e^(4*x)+e^(9*x). [From _Mohammad K. Azarian_, Dec 26 2008]

E.g.f.: e^x + e^(4*x) + e^(9*x). (End)

a(n) = 13*a(n-1) - 36*a(n-2) + 24 with a(0)=3, a(1)=14 [From _. - _Vincenzo Librandi_, Jul 21 2010]

CROSSREFS
STATUS

approved

editing

#14 by Charles R Greathouse IV at Fri Jun 12 15:25:10 EDT 2015
LINKS

<a href="/index/Rea#recLCCRec">Index entries for linear recurrences with constant coefficients</a>, signature (14,-49,36).

Discussion
Fri Jun 12
15:25
OEIS Server: https://oeis.org/edit/global/2436