# [seqfan] Re: Angry Recurrences

Alex M timeroot.alex at gmail.com
Tue Feb 4 09:32:27 CET 2014

```The orders look like they're roughly the fibonacci sequence.
13 <--> 13
22 <--> 21
34 <--> 34
55 <--> 55
88 <--> 89

could be coincidence.

~6 out of 5 statisticians say that the
number of statistics that either make
no sense or use ridiculous timescales
at all has dropped over 164% in the
last 5.62474396842 years.

On Sat, Feb 1, 2014 at 1:25 PM, Ron Hardin <rhhardin at att.net> wrote:

> https://oeis.org/A236949
>
> T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum of every 2X2
> subblock equal
>
> has recurrences that grow large coefficients faster than any I recall (and
> growing in degree if anything unusually slowly)
>
> Empirical for column k:
> k=1: a(n) = 16*a(n-1) -650*a(n-3) +596*a(n-4) +5184*a(n-5) -1365*a(n-6)
> -3780*a(n-7)
> k=2: [order 10]
> k=3: [order 13]
> k=4: [order 22]
> k=5: [order 34]
> k=6: [order 55]
> k=7: [order 88]
>
> The k=7 recurrence has coefficients up to about 10^170.
> https://oeis.org/A236948/a236948.txt
>
>
>
> rhhardin at mindspring.com
> rhhardin at att.net (either)
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
>
```