|
%I #12 Nov 28 2013 02:10:10
%S 1,1,3,2,1,1,2,3,1,1,3,3,1,1,5,2,1,1,2,3,1,1,3,3,1,1,3,2,1,1,2,4,1,1,
%T 3,3,1,1,3,2,1,1,2,3,1,1,4,4,1,1,3,2,1,1,2,3,1,1,3,3,1,1,4,2,1,1,2,3,
%U 1,1,3,3,1,1,3,2,1,1,2,5,1,1,3,3,1,1,3
%N a(n) = largest m such that m! divides 1+2+...+n; a(n) = A055881(A000217(n)).
%H Antti Karttunen, <a href="/A232096/b232096.txt">Table of n, a(n) for n = 1..10080</a>
%F a(n) = A055881(A000217(n)).
%F a(n) = A231719(A226061(n+1)). [Not a practical way to compute this sequence, but follows from the definitions]
%o (Scheme)
%o (define (A232096 n) (A055881 (A000217 n)))
%Y A042963 gives the positions of ones and A014601 the positions of larger terms.
%Y Cf. also A232097, A076733, A232094, A232095, A232098.
%K nonn
%O 1,3
%A _Antti Karttunen_, Nov 18 2013
|
