partition into strokes

[Max Alekseyev]

On 9/9/07, Max Alekseyev <maxale at gmail.com> wrote:

> I propose a new formula:
>
> A131519(n) = 11*A131519(n-1) - 24*A131519(n-3) for n>3.

Ops. It should be n>4. This formula does not work for n=4 (and it is
not clear how u(1), v(1), w(1), and z(1) from previous email should be
defined).

> And the sequence is
>
> 1, 6, 66, 714, 7710, ...

Max



Maximilian Hasler:

> They are already in OEIS:
> http://www.research.att.com/~njas/sequences/?q=square+identical+digit
> (along with A119511 resp. A119998: the smallest positive integer whose
> square starts with precisely (resp.at least) n identical digits)
> which might get extended using Hans' code.

For what it's worth, I've put up a 1000 terms of A119511 here:

http://chesswanks.com/seq/b119511.txt

A119998 is, of course, just a simple transform of this sequence.  
Incidentally, the frequency of the digits 1-9 resulting as that  
identical starting digit in the first 1000 squares of A119511 is  
{313,202,149,52,87,65,66,44,22}.

Hans