The On-Line Encyclopedia of Integer Sequences® (OEIS®)

The OEIS is supported by the many generous donors to the OEIS Foundation.

Revision History for A289296 (Underlined text is an addition; strikethrough text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A289296

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

#27 by Alois P. Heinz at Wed Jan 18 14:44:53 EST 2023

STATUS

reviewed

approved

#26 by Michel Marcus at Wed Jan 18 13:00:42 EST 2023

STATUS

proposed

reviewed

#25 by Chai Wah Wu at Wed Jan 18 12:48:26 EST 2023

STATUS

editing

proposed

#24 by Chai Wah Wu at Wed Jan 18 12:48:20 EST 2023

PROG

(Python)

def A289296(n): return (n-1)*(n|1) # Chai Wah Wu, Jan 18 2023

STATUS

approved

editing

#23 by N. J. A. Sloane at Tue Jul 04 21:22:14 EDT 2017

STATUS

proposed

approved

#22 by Colin Barker at Tue Jul 04 13:54:41 EDT 2017

STATUS

editing

proposed

#21 by Colin Barker at Tue Jul 04 13:54:21 EDT 2017

LINKS

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

STATUS

approved

editing

#20 by N. J. A. Sloane at Tue Jul 04 09:22:17 EDT 2017

STATUS

proposed

approved

#19 by Bruno Berselli at Tue Jul 04 04:31:37 EDT 2017

STATUS

editing

proposed

#18 by Bruno Berselli at Tue Jul 04 04:31:33 EDT 2017

COMMENTS

If k == 0 or 1 (mod 4) then A198442(k) is a member of this sequence. - _ if k == 0 or 1 (mod 4). - _Bruno Berselli_, Jul 04 2017

STATUS

proposed

editing

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 30 03:24 EDT 2024. Contains 375523 sequences. (Running on oeis4.)