cp's OEIS Frontend

A228194 Sum of lengths of longest contiguous subsequences with the same value over all s in {1,...,n}^n.

%I A228194 #35 Dec 20 2020 07:45:40
%S A228194 0,1,6,45,436,5345,79716,1403689,28518736,656835633,16913175310,
%T A228194 481496895121,15017297246832,509223994442449,18652724643726460,
%U A228194 733989868341011325,30879549535458286096,1383134389475750109089,65714992805644764521724,3300990246208225995520681
%N A228194 Sum of lengths of longest contiguous subsequences with the same value over all s in {1,...,n}^n.
%H A228194 Alois P. Heinz, <a href="/A228194/b228194.txt">Table of n, a(n) for n = 0..200</a>
%H A228194 Project Euler, <a href="https://projecteuler.net/problem=427">Problem 427: n-sequences</a>
%F A228194 a(n) = Sum_{k=1..n} k*A228154(n,k).
%F A228194 a(n) ~ (2-exp(-1)) * n^n. - _Vaclav Kotesovec_, Sep 10 2014
%e A228194 a(2) = 6 = 2+1+1+2: [1,1], [1,2], [2,1], [2,2].
%p A228194 a:= proc(n) option remember; local b; b:=
%p A228194       proc(m, s, i) option remember; `if`(m>i or s>m, 0,
%p A228194        `if`(i=1, n, `if`(s=1, (n-1)*add(b(m, h, i-1), h=1..m),
%p A228194         b(m, s-1, i-1) +`if`(s=m, b(m-1, s-1, i-1), 0))))
%p A228194       end; forget(b);
%p A228194       add(m*add(b(m, s, n), s=1..m), m=1..n)
%p A228194     end:
%p A228194 seq(a(n), n=0..30);
%t A228194 a[n_] := a[n] = Module[{b}, b[m_, s_, i_] := b[m, s, i] = If[m>i || s>m, 0, If[i==1, n, If[s==1, (n-1) Sum[b[m, h, i-1], {h, 1, m}], b[m, s-1, i-1] + If[s==m, b[m-1, s-1, i-1], 0]]]]; Sum[m Sum[b[m, s, n], {s, 1, m}], {m, 1, n}]];
%t A228194 Table[a[n], {n, 0, 30}] (* _Jean-François Alcover_, Dec 20 2020, after _Alois P. Heinz_ *)
%Y A228194 Main diagonal of A228250.
%Y A228194 Cf. A228618.
%K A228194 nonn
%O A228194 0,3
%A A228194 _Alois P. Heinz_, Aug 17 2013