The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A214041

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

A214041

a(n) = a(n-1) + floor((a(n-2) + a(n-3))/2), with a(n)=1 for n < 3.
(history; published version)

#14 by Alois P. Heinz at Fri May 21 17:47:09 EDT 2021

STATUS

proposed

approved

#13 by Jon E. Schoenfield at Fri May 21 17:28:17 EDT 2021

STATUS

editing

proposed

#12 by Jon E. Schoenfield at Fri May 21 17:28:15 EDT 2021

NAME

a(n) = a(n-1) + floor((a(n-2) + a(n-3))/2), with a(n)=1 for n < 3.

COMMENTS

a(n) = A022875(n) for 1 < n < 15.

STATUS

proposed

editing

#11 by F. Chapoton at Fri May 21 12:45:38 EDT 2021

STATUS

editing

proposed

#10 by F. Chapoton at Fri May 21 12:45:30 EDT 2021

PROG

cur=prev+(prpr+ppp)//2

print (str(ppp)+, end=', ', )

STATUS

approved

editing

Discussion

Fri May 21

12:45

F. Chapoton: adapt py code to py3

#9 by Harvey P. Dale at Sun Jun 14 18:20:35 EDT 2020

STATUS

editing

approved

#8 by Harvey P. Dale at Sun Jun 14 18:20:32 EDT 2020

LINKS

Harvey P. Dale, <a href="/A214041/b214041.txt">Table of n, a(n) for n = 0..1000</a>

STATUS

approved

editing

#7 by Harvey P. Dale at Sun Jun 14 18:19:15 EDT 2020

STATUS

editing

approved

#6 by Harvey P. Dale at Sun Jun 14 18:19:13 EDT 2020

MATHEMATICA

nxt[{a_, b_, c_}]:={b, c, c+Floor[(a+b)/2]}; NestList[nxt, {1, 1, 1}, 50][[All, 1]] (* Harvey P. Dale, Jun 14 2020 *)

STATUS

approved

editing

#5 by N. J. A. Sloane at Tue Jul 03 16:02:59 EDT 2012

STATUS

proposed

approved