[go: up one dir, main page]

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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Revision History for A267182 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A267182 Row 2 of the square array in A267181.
(history; published version)
#12 by N. J. A. Sloane at Thu Feb 07 12:52:15 EST 2019
STATUS

editing

approved

#11 by N. J. A. Sloane at Thu Feb 07 12:52:13 EST 2019
COMMENTS

Conjectures_Colin Barker_'s conjectures below are true.

FORMULA

(End)) [These are true - see Comments]

STATUS

proposed

editing

#10 by Charlie Neder at Wed Feb 06 21:59:15 EST 2019
STATUS

editing

proposed

#9 by Charlie Neder at Wed Feb 06 21:59:11 EST 2019
COMMENTS

From Charlie Neder, Feb 06 2019: (Start)

Conjectures below are true.

From _Charlie Neder_, Feb 06 2019: (Start)Conjectures below are true.Proof: A267181(ka,kb) = A267181(a,b) since both operations preserve the greatest common factor of the two coordinates, so A267181(2k,2) = A267181(k,1) = k for k > 1, the second conjecture. For odd coordinates, we have the forced chain (2k+1,2) -> (2,2k+1) -> (2,2k-1) -> ... -> (2,1) -> (1,2) -> (1,1) with k+3 operations, the third conjecture. The rest follow from combining these. (End)

#8 by Charlie Neder at Wed Feb 06 21:58:03 EST 2019
COMMENTS

From Charlie Neder, Feb 06 2019: (Start)Conjectures below are true.Proof: A267181(ka,kb) = A267181(a,b) since both operations preserve the greatest common factor of the two coordinates, so A267181(2k,2) = A267181(k,1) = k, the second conjecture. For odd coordinates, we have the forced chain (2k+1,2) -> (2,2k+1) -> (2,2k-1) -> ... -> (2,1) -> (1,2) -> (1,1) with k+3 operations, the third conjecture. The rest follow from combining these. (End)

STATUS

approved

editing

#7 by Michel Marcus at Fri Jan 29 10:51:21 EST 2016
STATUS

reviewed

approved

#6 by Joerg Arndt at Fri Jan 29 10:39:41 EST 2016
STATUS

proposed

reviewed

#5 by Colin Barker at Fri Jan 29 09:49:59 EST 2016
STATUS

editing

proposed

#4 by Colin Barker at Fri Jan 29 09:49:44 EST 2016
FORMULA

Conjectures from Colin Barker, Jan 29 2016: (Start)

a(n) = (1-5*(-1)^n+2*n)/4 for n>0.

a(n) = (n-2)/2 for n>0 and even.

a(n) = (n+3)/2 for n odd.

a(n) = a(n-1)+a(n-2)-a(n-3) for n>3.

G.f.: (1+x-3*x^2+2*x^3) / ((1-x)^2*(1+x)).

(End)

STATUS

approved

editing

#3 by N. J. A. Sloane at Sun Jan 17 07:54:10 EST 2016
STATUS

editing

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 21:13 EDT 2024. Contains 375518 sequences. (Running on oeis4.)