[go: up one dir, main page]

login
Revision History for A162326 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Let a(0) = a(1) = 1, and n*a(n) = 2*(-7+5*n)*a(n-1) + 9*(2-n)*a(n-2) for n >= 2.
(history; published version)
#86 by N. J. A. Sloane at Tue Sep 03 01:41:31 EDT 2024
STATUS

proposed

approved

#85 by Mikhail Kurkov at Sun Sep 01 05:09:56 EDT 2024
STATUS

editing

proposed

#84 by Mikhail Kurkov at Sun Sep 01 05:09:39 EDT 2024
FORMULA

Conjecture: a(n) = v_t_n for n > 0 with a(0) = 1 where we start with vector v of fixed length n m with elements v_i = 1 , then set t = v and for i=1..nm-1, for j=i+1..n m apply [v_i, v_j] := [v_i + 2*v_j, 2*v_i + v_j] (here square brackets mean that instead of sequentially assigning v_i and then v_j, we reserve their values (for example, as A = v_i, B = v_j) and then assign them in any order) and t_{i+1} := v_{i+1} (after ending each cycle for j). Changing It also looks like that if we change 2*v_i + v_j to xz*v_i + v_j leads it gives us to a(n+1) = Sum_{k=0..n} A090981(n, k)*2^(n-k) for n >= 0. - Mikhail Kurkov, Aug 14 2024

STATUS

proposed

editing

#83 by Mikhail Kurkov at Wed Aug 14 12:50:53 EDT 2024
STATUS

editing

proposed

#82 by Mikhail Kurkov at Wed Aug 14 12:49:29 EDT 2024
FORMULA

Conjecture: a(n) = v_n for n > 0 with a(0) = 1 where we start with vector v of length n with elements v_i = 1 and for i=1..n-1, for j=i+1..n apply [v_i, v_j] = [v_i + 2*v_j, 2*v_i + v_j] (here square brackets mean that instead of sequentially assigning v_i and then v_j, we reserve their values (for example, as A = v_i, B = v_j) and then assign them in any order). It also looks like Changing 2*v_i + v_j to x*v_i + v_j leads us to a(n+1) = 1 + 2*Sum_{ik=10..n} v_i A090981(n, k)*2^(n-k) for n > = 0. - Mikhail Kurkov, Aug 14 2024

STATUS

proposed

editing

#81 by Mikhail Kurkov at Wed Aug 14 02:09:36 EDT 2024
STATUS

editing

proposed

#80 by Mikhail Kurkov at Wed Aug 14 02:09:25 EDT 2024
FORMULA

Conjecture: a(n) = v_n for n > 0 with a(0) = 1 where we start with vector v of length n with elements v_i = 1 and for i=1..n-1, for j=i+1..n apply [v_i, v_j] = [v_i + 2*v_j, 2*v_i + v_j] (here square brackets mean that instead of sequentially assigning v_i and then v_j, we reserve their values (for example, as A = v_i, B = v_j) and then assign them in any order). It also looks like a(n+1) = 1 + 2*Sum_{i=1..n} v_i for n > 0. - Mikhail Kurkov, Aug 14 2024

STATUS

approved

editing

#79 by Charles R Greathouse IV at Thu Sep 08 08:45:46 EDT 2022
PROG

(MAGMAMagma) m:=20; R<x>:=PowerSeriesRing(Rationals(), m); Coefficients(R!( (5-Sqrt((1-9*x)/(1-x)))/4 )); // G. C. Greubel, Feb 07 2019

(MAGMAMagma) a:=[1, 3]; for n in [3..21] do Append(~a, (2*(-7+5*n)*a[n-1] + 9*(2-n)*a[n-2]) div n); end for ; [1] cat a; // Marius A. Burtea, Jan 20 2020

Discussion
Thu Sep 08
08:45
OEIS Server: https://oeis.org/edit/global/2944
#78 by Peter Luschny at Thu Apr 09 16:37:50 EDT 2020
STATUS

reviewed

approved

#77 by Michel Marcus at Thu Apr 09 12:54:06 EDT 2020
STATUS

proposed

reviewed