A230406 - OEIS

%I #9 Nov 12 2013 12:43:34

%S 0,1,1,3,2,3,2,5,6,2,3,2,5,5,6,2,4,5,6,7,4,5,6,7,5,5,7,10,2,3,2,5,5,6,

%T 2,4,5,6,7,4,5,6,7,5,5,6,9,8,7,10,2,4,5,6,7,4,5,6,7,5,5,6,8,6,8,8,7,

%U 10,11,4,5,6,7,5,5,6,8,6,8,8,7,10,12,10,11

%N a(n) = A034968(A219666(n)); after zero, the differences between successive nodes in the infinite trunk of the factorial beanstalk (A219666).

%C Also the first differences of A219666, shifted once right and prepended with zero.

%C This sequence relates to the factorial base representation (A007623) in the same way as A213712 relates to the binary system.

%H Antti Karttunen, <a href="/A230406/b230406.txt">Table of n, a(n) for n = 0..3149</a>

%F a(n) = A034968(A219666(n)).

%F a(0) = 0, and for n>=1, a(n) = A219666(n) - A219666(n-1).

%F a(A226061(n)) = A000217(n-1) for all n.

%o (Scheme)

%o (define (A230406 n) (A034968 (A219666 n)))

%o ;; Alternative definition:

%o (define (A230406 n) (if (zero? n) n (- (A219666 n) (A219666 (- n 1)))))

%Y Cf. also A230418, A230410.

%K nonn

%O 0,4

%A _Antti Karttunen_, Nov 09 2013