The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A329774 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A329774

a(n) = n+1 for n <= 2; otherwise a(n) = 3*a(n-3)+1.
(history; published version)

#19 by N. J. A. Sloane at Fri Dec 06 13:39:30 EST 2019

STATUS

editing

approved

#18 by N. J. A. Sloane at Fri Dec 06 13:39:28 EST 2019

CROSSREFS

A mixture of A003462, A060816, and A329773A237930. Cf. A328078.

STATUS

approved

editing

#17 by Susanna Cuyler at Wed Nov 27 12:52:31 EST 2019

STATUS

proposed

approved

#16 by Colin Barker at Wed Nov 27 12:42:51 EST 2019

STATUS

editing

proposed

#15 by Colin Barker at Wed Nov 27 12:41:16 EST 2019

LINKS

Colin Barker, <a href="/A329774/b329774.txt">Table of n, a(n) for n = 0..1000</a>

<a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,3,-3).

PROG

(PARI) Vec((1 + x + x^2 - 2*x^3) / ((1 - x)*(1 - 3*x^3)) + O(x^40)) \\ Colin Barker, Nov 27 2019

KEYWORD

nonn,new,easy

STATUS

approved

editing

#14 by Michel Marcus at Wed Nov 27 11:27:00 EST 2019

STATUS

reviewed

approved

#13 by Joerg Arndt at Wed Nov 27 11:17:16 EST 2019

STATUS

proposed

reviewed

#12 by Joerg Arndt at Wed Nov 27 11:17:05 EST 2019

STATUS

editing

proposed

#11 by Joerg Arndt at Wed Nov 27 11:16:59 EST 2019

FORMULA

Conjectures from _From _Colin Barker_, Nov 27 2019: (Start)

STATUS

proposed

editing

#10 by Colin Barker at Wed Nov 27 11:11:11 EST 2019

STATUS

editing

proposed