The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A169609

Period 3: repeat [1, 3, 3].
(history; published version)

#40 by Alois P. Heinz at Thu Aug 29 17:50:39 EDT 2024

FORMULA

a(n) = floor((n+3)/3)+2*floor((n+2)/3)-3*floor(n/3). - Aaron J Grech, Aug 28 2024

KEYWORD

easy,cofr,cons,nonn,changed

STATUS

editing

approved

#39 by Alois P. Heinz at Thu Aug 29 17:49:18 EDT 2024

STATUS

proposed

editing

Discussion

Thu Aug 29

17:50

Alois P. Heinz: complicated formula for trivial sequence ...

#38 by Aaron J Grech at Wed Aug 28 15:23:13 EDT 2024

STATUS

editing

proposed

Discussion

Thu Aug 29

03:06

Joerg Arndt: Not convinced.

17:49

Alois P. Heinz: same: not convinced ...

#37 by Aaron J Grech at Wed Aug 28 15:23:10 EDT 2024

FORMULA

a(n) = floor((n+3)/3)+2*floor((n+2)/3)-3*floor(n/3). - Aaron J Grech, Aug 28 2024

STATUS

approved

editing

#36 by Joerg Arndt at Tue Dec 12 08:10:03 EST 2023

STATUS

proposed

approved

#35 by Paolo P. Lava at Tue Dec 12 07:47:57 EST 2023

STATUS

editing

proposed

#34 by Paolo P. Lava at Tue Dec 12 07:47:54 EST 2023

FORMULA

a(n) = (13*(n mod 3)+7*(n+1 mod 3)+(n+2 mod 3))/9 (cf. forms of modular arithmetic of Paolo P. Lava, i.e., see A146094). [Bruno Berselli, Sep 27 2010]

STATUS

approved

editing

#33 by Joerg Arndt at Tue Dec 12 07:39:31 EST 2023

STATUS

proposed

approved

#32 by Paolo P. Lava at Tue Dec 12 07:36:12 EST 2023

STATUS

editing

proposed

#31 by Paolo P. Lava at Tue Dec 12 07:36:08 EST 2023

FORMULA

a(n) = 2*(n^2 mod 3)+1. [Paolo P. Lava, Dec 14 2009]

STATUS

approved

editing