|
| |
|
|
A109381
|
|
Maximum digit of n^2 written in base factorial.
|
|
0
| |
|
|
0, 1, 2, 1, 2, 1, 2, 2, 2, 3, 4, 1, 1, 2, 3, 4, 2, 2, 3, 3, 3, 3, 4, 4, 4, 5, 5, 1, 2, 1, 2, 2, 2, 3, 3, 4, 4, 5, 2, 3, 2, 2, 3, 3, 4, 4, 5, 3, 3, 3, 4, 3, 4, 5, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 1, 1, 2, 3, 4, 2, 2, 3, 4, 5, 3, 2, 3, 4, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 2, 3, 4, 2
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| Conjecture: lim_{n->infinity} a(n) = infinity. If true, convergence is very slow, since a(1183893) = 1. Sequence is certainly unbounded, since for n >= 4, there is always a square between n*n! and (n+1)!.
|
|
|
EXAMPLE
| 4^2 = 16 = 2*6+2*2 = 220(base factorial), so a(4) = max(2,2,0) = 2.
|
|
|
CROSSREFS
| Cf. Indices of 1's in this sequence are A014597.
Sequence in context: A133989 A029398 A025817 * A058506 A106698 A097848
Adjacent sequences: A109378 A109379 A109380 * A109382 A109383 A109384
|
|
|
KEYWORD
| easy,nonn,base
|
|
|
AUTHOR
| Frank Adams-Watters (FrankTAW(AT)Netscape.net), Aug 25 2005
|
| |
|
|
