|
%I #50 May 26 2024 08:21:05
%S 1,2,1,2,1,2,3,3,3,1,4,1,2,5,2,3,6,3,7,1,4,4,1,8,5,5,1,4,9,4,1,6,6,5,
%T 10,5,1,2,7,7,2,1,6,11,6,1,2,7,12,7,2,1,13,3,8,8,3,4,9,9,4,14,1,2,5,
%U 10,10,5,2,1,3,8,15,8,3,4,9,16,9,4,17,6,11,11,6,1,2,5,10,18,10
%N Lexicographically earliest sequence starting 1,2 which can be arranged in a mirror symmetric array shape such that a(n) is the length of the n-th row and no column has the same value more than once.
%C For row 5 onward, the row contents are mirror symmetric too (palindromes), as well as the shape.
%C Terms in the same column are successive positive integers (with some initial exceptions before row 5).
%H Neal Gersh Tolunsky, <a href="/A367251/b367251.txt">Table of n, a(n) for n = 1..10000</a>
%H Thomas Scheuerle, <a href="/A367251/a367251.png">blue: scatter plot of a(1) to a(10000); red: length of the row where a(n) is contained</a>.
%H Neal Gersh Tolunsky, <a href="/A367251/a367251_5.png">First differences of first 100000 terms</a>.
%H Neal Gersh Tolunsky, <a href="/A367251/a367251_6.png">Ordinal transform of first 100000 terms</a>.
%H Neal Gersh Tolunsky, <a href="/A367251/a367251_7.png">Graph of first 100000 terms</a>.
%e Array (or "tree") begins, with mirror symmetry in row 5 and beyond:
%e columns v v v v v v v
%e row 1: 1,
%e row 2: 2, 1,
%e row 3: 2,
%e row 4: 1, 2,
%e row 5: 3,
%e row 6: 3, 3,
%e row 7: 1, 4, 1,
%e row 8: 2, 5, 2,
%e row 9: 3, 6, 3,
%e row 10: 7,
%e row 11: 1, 4, 4, 1,
%e row 12: 8,
%e row 13: 5, 5,
%o (MATLAB)
%o function a = A367251( max_n )
%o a = [1 2 1 2 1 2];
%o odd = zeros(1,max_n); even = odd;
%o odd(1) = 2; even(1)= 2; c = 5;
%o while length(a) < max_n
%o if mod(a(c),2) == 1
%o odd(1:(a(c)+1)/2) = odd(1:(a(c)+1)/2)+1;
%o a = [a odd((a(c)+1)/2:-1:2) odd(1:(a(c)+1)/2)];
%o else
%o even(1:a(c)/2) = even(1:a(c)/2)+1;
%o a = [a even(a(c)/2:-1:1) even(1:a(c)/2)];
%o end
%o c = c + 1;
%o end
%o end % _Thomas Scheuerle_, Nov 21 2023
%Y Cf. A334081, A253028.
%K nonn,tabf
%O 1,2
%A _Neal Gersh Tolunsky_, Nov 11 2023
|
