The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A140201

Partial sums of A140081.
(history; published version)

#69 by Charles R Greathouse IV at Thu Sep 08 08:45:34 EDT 2022

PROG

(MAGMAMagma) I:=[0, 1, 2, 4, 4]; [n le 5 select I[n] else Self(n-1)+Self(n-4)-Self(n-5): n in [1..80]]; // Vincenzo Librandi, Sep 17 2012

Discussion

Thu Sep 08

08:45

OEIS Server: https://oeis.org/edit/global/2944

#68 by Alois P. Heinz at Thu Jun 10 15:50:57 EDT 2021

CROSSREFS

Cf. A002265, A004524, A004526, A042948, A047624, A057353, A121262, A140081.

KEYWORD

easy,nonn,changed

STATUS

reviewed

approved

#67 by Michel Marcus at Thu Jun 10 12:28:30 EDT 2021

STATUS

proposed

reviewed

#66 by Karl V. Keller, Jr. at Thu Jun 10 12:20:54 EDT 2021

STATUS

editing

proposed

Discussion

Thu Jun 10

12:28

Michel Marcus: so no-op ?

#65 by Karl V. Keller, Jr. at Wed Jun 02 22:59:59 EDT 2021

FORMULA

a(n) = n + 0^((n-3) mod 4) for n>=0. - Karl V. Keller, Jr., Jun 02 2021

PROG

(Python) print([n + 0**((n-3)%4) for n in range(80)]) # Karl V. Keller, Jr., Jun 02 2021

STATUS

proposed

editing

Discussion

Wed Jun 02

23:02

Karl V. Keller, Jr.: Removed the formula and code.  Bruno Berselli's formula is the same.

Thu Jun 03

02:22

Kevin Ryde: You can still put a code if you like.  (A "def a(n): n + ..." for instance, to show accumulates or linrecs not needed :-)

Thu Jun 10

02:27

OEIS Server: This sequence has not been edited or commented on for a week
yet is not proposed for review.  If it is ready for review, please
visit https://oeis.org/draft/A140201 and click the button that reads
"These changes are ready for review by an OEIS Editor."

Thanks.
  - The OEIS Server

#64 by Karl V. Keller, Jr. at Wed Jun 02 15:19:57 EDT 2021

STATUS

editing

proposed

Discussion

Wed Jun 02

20:02

Kevin Ryde: Formula much the same as Bruno Berselli's last.  In code, an "==0" (or similar) would be more usual than "0**".  (Can't help feeling 0** explores an infrequently visited corner of programming numerics!)

#63 by Karl V. Keller, Jr. at Wed Jun 02 15:17:24 EDT 2021

FORMULA

a(n) = 2*floor((n-1)/2 +1) - 0^((n-13) mod 4) for n>=0. - Karl V. Keller, Jr., Jun 01 02 2021

PROG

(Python) print([2*((n-1)//2 +1)- 0**((n-13)%4) for n in range(80)]) # Karl V. Keller, Jr., Jun 01 02 2021

STATUS

proposed

editing

Discussion

Wed Jun 02

15:18

Karl V. Keller, Jr.: Thank you, Kevin.  Simplified formula and code.

#62 by Michel Marcus at Wed Jun 02 00:15:42 EDT 2021

STATUS

editing

proposed

Discussion

Wed Jun 02

00:40

Kevin Ryde: Code may be easier as equivalent of n + (bitand(n,3)==3).

#61 by Michel Marcus at Wed Jun 02 00:15:39 EDT 2021

CROSSREFS

Cf. A002265, A004524, A004526, A042948, A047624, A057353, A121262, A140081.

STATUS

proposed

editing

#60 by Karl V. Keller, Jr. at Tue Jun 01 23:14:36 EDT 2021

STATUS

editing

proposed