The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A002083

Narayana-Zidek-Capell numbers: a(n) = 1 for n <= 2. Otherwise a(2n) = 2a(2n-1), a(2n+1) = 2a(2n) - a(n).
(history; published version)

#157 by R. J. Mathar at Fri Jun 07 04:42:37 EDT 2024

STATUS

editing

approved

#156 by R. J. Mathar at Fri Jun 07 04:42:25 EDT 2024

MAPLE

A002083 := proc(n) option remember; if n<=3 then 1 elif n mod 2 = 0 then 2*A002083procname(n-1) else 2*A002083procname(n-1)-A002083procname((n-1)/2); fi; end if; end proc:

STATUS

approved

editing

#155 by Andrew Howroyd at Sat Oct 28 11:49:06 EDT 2023

STATUS

reviewed

approved

#154 by Joerg Arndt at Sat Oct 28 11:27:40 EDT 2023

STATUS

proposed

reviewed

#153 by Michel Marcus at Sat Oct 28 11:02:17 EDT 2023

STATUS

editing

proposed

#152 by Michel Marcus at Sat Oct 28 11:02:10 EDT 2023

LINKS

D. Levin, L. Pudwell, M. Riehl and A. Sandberg, <a href="httphttps://www.etsu.edu/cas/math/pp2014/documents/talks/riehl.pdf">Pattern Avoidance on k-ary Heaps</a>, Slides of Talk, 2014.

STATUS

proposed

editing

#151 by Jon E. Schoenfield at Sat Oct 28 10:58:52 EDT 2023

STATUS

editing

proposed

#150 by Jon E. Schoenfield at Sat Oct 28 10:58:47 EDT 2023

LINKS

T. D. Noe and Seiichi Manyama, <a href="/A002083/b002083.txt">Table of n, a(n) for n = 1..3325</a> (first 200 terms from T. D. Noe)

STATUS

approved

editing

#149 by Michael De Vlieger at Tue Nov 08 13:59:19 EST 2022

STATUS

reviewed

approved

#148 by Michel Marcus at Tue Nov 08 12:15:59 EST 2022

STATUS

proposed

reviewed