This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A230430 #6 Nov 12 2013 13:14:16 %S A230430 0,3,4,6,11,13,16,22,24,29,31,34,41,47,49,53,56,62,71,75,78,84,93,96, %T A230430 103,108,118,120,125,127,130,137,143,145,149,152,158,167,171,174,180, %U A230430 189,192,199,205,212,220,229,239,241,245,248,254,263,267,270,276,285 %N A230430 After zero, gives the numbers where finite side-trees (or "tendrils") of factorial beanstalk branch off from its infinite trunk (A219666). %C A230430 This sequence relates to the factorial base representation (A007623) in the same way as A213730 relates to the binary system. %H A230430 Antti Karttunen, <a href="/A230430/b230430.txt">Table of n, a(n) for n = 0..3149</a> %F A230430 a(n) = A219666(n+1) + (-1)^A219666(n+1). %F A230430 a(n) = A230423(A219666(n)) + (1 - (A219666(n+1) mod 2)). %o A230430 (Scheme) %o A230430 (define (A230430 n) (+ (A230423 (A219666 n)) (- 1 (modulo (A219666 (1+ n)) 2)))) %o A230430 ;; Alternative definition: %o A230430 (define (A230430 n) (+ (A219666 (+ 1 n)) (expt -1 (modulo (A219666 (+ 1 n)) 2)))) %Y A230430 Cf. A230407. %K A230430 nonn %O A230430 0,2 %A A230430 _Antti Karttunen_, Nov 10 2013