login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

a(n) = a(n-1) * a(n-6) * (a(n-2) * a(n-5) * (a(n-3) * a(n-4) + 1) + 1) / a(n-7), with a(0) = a(1) = a(2) = a(3) = a(4) = a(5) = a(6) = 1.
2

%I #33 Jan 12 2025 05:00:01

%S 1,1,1,1,1,1,1,3,9,63,2331,4114215,16341764835375,

%T 266584861903285121344257375,

%U 7896333852271846954822982651737848156847060737115875,2309336603704915706429640788623787983392652603516450553629239932054220008270731649775618317371336467375

%N a(n) = a(n-1) * a(n-6) * (a(n-2) * a(n-5) * (a(n-3) * a(n-4) + 1) + 1) / a(n-7), with a(0) = a(1) = a(2) = a(3) = a(4) = a(5) = a(6) = 1.

%C Inspired by Somos-7 sequence.

%C a(n) is an integer for n >= 0.

%C a(n+1)/a(n) is an integer for n >= 0.

%H Seiichi Manyama, <a href="/A276535/b276535.txt">Table of n, a(n) for n = 0..18</a>

%F a(n) * a(n-7) = a(n-1) * a(n-6) + a(n-1) * a(n-2) * a(n-5) * a(n-6) + a(n-1) * a(n-2) * a(n-3) * a(n-4) * a(n-5) * a(n-6).

%F a(6-n) = a(n).

%F Let b(n) = b(n-6) * (b(n-2) * b(n-3) * b(n-4) * (b(0) * b(1) * ... * b(n-5))^2 * (b(n-3) * (b(0) * b(1) * ... * b(n-4))^2 + 1)+ 1) with b(0) = b(1) = b(2) = b(3) = b(4) = b(5) = 1, then a(n) = a(n-1) * b(n-1) = b(0) * b(1) * ... * b(n-1) for n > 0.

%e a(7) = a(6) * b(6) = 1 * 3 = 3,

%e a(8) = a(7) * b(7) = 3 * 3 = 9,

%e a(9) = a(8) * b(8) = 9 * 7 = 63,

%e a(10) = a(9) * b(9) = 63 * 37 = 2331.

%o (Ruby)

%o def A(k, n)

%o a = Array.new(2 * k + 1, 1)

%o ary = [1]

%o while ary.size < n + 1

%o i = 0

%o k.downto(1){|j|

%o i += 1

%o i *= a[j] * a[-j]

%o }

%o break if i % a[0] > 0

%o a = *a[1..-1], i / a[0]

%o ary << a[0]

%o end

%o ary

%o end

%o def A276535(n)

%o A(3, n)

%o end

%Y Cf. A006723, A276534.

%K nonn

%O 0,8

%A _Seiichi Manyama_, Nov 16 2016