login
A230430
After zero, gives the numbers where finite side-trees (or "tendrils") of factorial beanstalk branch off from its infinite trunk (A219666).
5
0, 3, 4, 6, 11, 13, 16, 22, 24, 29, 31, 34, 41, 47, 49, 53, 56, 62, 71, 75, 78, 84, 93, 96, 103, 108, 118, 120, 125, 127, 130, 137, 143, 145, 149, 152, 158, 167, 171, 174, 180, 189, 192, 199, 205, 212, 220, 229, 239, 241, 245, 248, 254, 263, 267, 270, 276, 285
OFFSET
0,2
COMMENTS
This sequence relates to the factorial base representation (A007623) in the same way as A213730 relates to the binary system.
LINKS
FORMULA
a(n) = A219666(n+1) + (-1)^A219666(n+1).
a(n) = A230423(A219666(n)) + (1 - (A219666(n+1) mod 2)).
PROG
(Scheme)
(define (A230430 n) (+ (A230423 (A219666 n)) (- 1 (modulo (A219666 (1+ n)) 2))))
;; Alternative definition:
(define (A230430 n) (+ (A219666 (+ 1 n)) (expt -1 (modulo (A219666 (+ 1 n)) 2))))
CROSSREFS
Cf. A230407.
Sequence in context: A294917 A115018 A057030 * A154331 A001130 A348529
KEYWORD
nonn
AUTHOR
Antti Karttunen, Nov 10 2013
STATUS
approved