The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A214972

a(n) = a(floor(2*(n-1)/3)) + 1, where a(0) = 0.
(history; published version)

#30 by Bruno Berselli at Wed Oct 31 09:32:59 EDT 2012

STATUS

proposed

approved

#29 by Martin Ettl at Wed Oct 31 08:37:00 EDT 2012

STATUS

editing

proposed

#28 by Martin Ettl at Wed Oct 31 08:36:56 EDT 2012

PROG

(Maxima)

a[0]:0$

a[n]:=a[floor(2*(n-1)/3)] + 1$

A214972(n):=a[n];

makelist(A214972(n), n, 0, 30); /* Martin Ettl, Oct 31 2012 */

STATUS

approved

editing

#27 by Bruno Berselli at Wed Oct 31 02:25:29 EDT 2012

STATUS

reviewed

approved

#26 by Michael B. Porter at Wed Oct 31 01:02:42 EDT 2012

STATUS

proposed

reviewed

#25 by Michael B. Porter at Wed Oct 31 01:00:14 EDT 2012

STATUS

editing

proposed

#24 by Michael B. Porter at Wed Oct 31 00:59:13 EDT 2012

PROG

(PARI) a214972(n) = {local(nn, r); nn=n; r=0; while(nn>0, r=r+1; nn=floor(2*(nn-1)/3)); r} \\ Michael B. Porter, Oct 30 2012

STATUS

proposed

editing

#23 by Franklin T. Adams-Watters at Wed Oct 31 00:29:35 EDT 2012

STATUS

editing

proposed

Discussion

Wed Oct 31

00:50

Michael B. Porter: Hey, you're reading my mind....
Michael

#22 by Franklin T. Adams-Watters at Wed Oct 31 00:29:14 EDT 2012

NAME

a(n) = a(floor(2*(n-1)/3)), + 1, where a(0) = 0.

#21 by Michael B. Porter at Wed Oct 31 00:27:35 EDT 2012

NAME

a(n) = a([floor(2*(n-1)/3]), ), where a(0) = 0 and [ ] = floor.

STATUS

proposed

editing