A230411 -id:A230411 - cp's OEIS frontend

A219666 The infinite trunk of factorial expansion beanstalk. The only infinite sequence such that a(n-1) = a(n) - sum of digits in factorial expansion of a(n).

0, 1, 2, 5, 7, 10, 12, 17, 23, 25, 28, 30, 35, 40, 46, 48, 52, 57, 63, 70, 74, 79, 85, 92, 97, 102, 109, 119, 121, 124, 126, 131, 136, 142, 144, 148, 153, 159, 166, 170, 175, 181, 188, 193, 198, 204, 213, 221, 228, 238, 240, 244, 249, 255, 262, 266, 271, 277

Offset: 0

Antti Karttunen, Nov 25 2012

a(n) tells in what number we end in n steps, when we start climbing up the infinite trunk of the "factorial beanstalk" from its root (zero).
There are many finite sequences such as 0,1,2,4; 0,1,2,5,6; etc. obeying the same condition (see A219659) and as the length increases, so (necessarily) does the similarity to this infinite sequence.
See A007623 for the factorial number system representation.

Antti Karttunen, Table of n, a(n) for n = 0..21622

Cf. A007623, A034968, A219651, A230411, A226061. For all n, A219652(a(n)) = n and A219653(n) <= a(n) <= A219655(n).
Characteristic function: Χ_A219666(n) = A230418(n+1)-A230418(n).
The first differences: A230406.
Other derived sequences: A230425-A230427, A230430, A230407-A230409, A219662 & A219663, A231723 & A231724, A230420, A230410, A231717, A231719.
Subsets: A230428 & A230429.
Analogous sequence for binary system: A179016, for Fibonacci number system: A219648.

nn = 10^3; m = 1; While[m! < Floor[6 nn/5], m++]; m; t = TakeWhile[Reverse@ NestWhileList[# - Total@ IntegerDigits[#, MixedRadix[Reverse@ Range[2, m]]] &, Floor[6 nn/5], # > 0 &], # <= nn &] (* Michael De Vlieger, Jun 27 2016, Version 10.2 *)

;; Memoizing definec-macro from Antti Karttunen's IntSeq-library
(definec (A219666 n) (cond ((<= n 2) n) ((= (A226061 (A230411 n)) n) (- (A000142 (A230411 n)) 1)) (else (- (A219666 (+ n 1)) (A034968 (A219666 (+ n 1)))))))
;; Another variant, utilizing A230416 (which gives a more convenient way to compute large number of terms of this sequence):
(define (A219666 n) (A230416 (A230432 n)))
;; This function is for checking whether n belongs to this sequence:
(define (inA219666? n) (or (zero? n) (= 1 (- (A230418 (+ 1 n)) (A230418 n)))))

a(0) = 0, a(1) = 1, and for n>1, if A226061(A230411(n)) = n then a(n) = A230411(n)!-1, otherwise a(n) = a(n+1) - A034968(a(n+1)).

a(n) = A230416(A230432(n)).

A230432 Simple self-inverse permutation of natural numbers: after zero, list each block of A219661(n) numbers in reverse order, from A226061(n+1) to A219665(n).

Original entry on oeis.org

0, 1, 3, 2, 8, 7, 6, 5, 4, 27, 26, 25, 24, 23, 22, 21, 20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 110, 109, 108, 107, 106, 105, 104, 103, 102, 101, 100, 99, 98, 97, 96, 95, 94, 93, 92, 91, 90, 89, 88, 87, 86, 85, 84, 83, 82, 81, 80, 79, 78, 77, 76, 75, 74, 73

Offset: 0

Antti Karttunen, Oct 22 2013

nonn

This permutation can be used to map between the sequences A219666 and A230416. E.g. A219666(n) = A230416(a(n)) and vice versa: A230416(n) = A219666(a(n)).

Antti Karttunen, Table of n, a(n) for n = 0..3149
Index entries for sequences that are permutations of the natural numbers

Cf. A219661, A219665, A226061, A230411, A219666, A230416, A230431.

Analogous sequence for binary system: A218602.

(define (A230432 n) (if (zero? n) n (- (A219665 (A230411 (+ 1 n))) (A230431 n) 1)))

a(n) = A219665(A230411(n+1)) - A230431(n) - 1.

A230431 After the first zero, integers from 0 to A219661(n)-1 followed by integers from 0 to A219661(n+1)-1, etc.

Original entry on oeis.org

0, 0, 0, 1, 0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44

Offset: 0

Antti Karttunen, Oct 22 2013

nonn

Cf. A219661, A219665, A230411. Used to compute A230432.

Analogous sequence for binary system: A218601.

(define (A230431 n) (if (< n 2) 0 (- n (A219665 (-1+ (A230411 (+ n 1)))))))

a(0) = a(1) = 0, and for n > 1, a(n) = n - A219665(A230411(n+1)-1).

cp's OEIS Frontend

A219666 The infinite trunk of factorial expansion beanstalk. The only infinite sequence such that a(n-1) = a(n) - sum of digits in factorial expansion of a(n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Scheme

Formula

A230432 Simple self-inverse permutation of natural numbers: after zero, list each block of A219661(n) numbers in reverse order, from A226061(n+1) to A219665(n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Scheme

Formula

A230431 After the first zero, integers from 0 to A219661(n)-1 followed by integers from 0 to A219661(n+1)-1, etc.

Views

Author

Keywords

Crossrefs

Programs

Scheme

Formula