A230410 -id:A230410 - cp's OEIS frontend

A230422 Positions of ones in A230410.

1, 8, 14, 16, 18, 22, 33, 35, 37, 41, 45, 51, 53, 57, 61, 71, 75, 82, 87, 96, 106, 116, 118, 120, 124, 128, 134, 136, 140, 144, 154, 158, 165, 170, 179, 189, 198, 200, 206, 208, 212, 216, 226, 230, 237, 242, 251, 261, 270, 272, 280, 289, 293, 300, 305, 314, 324

Offset: 1

Antti Karttunen, Nov 10 2013

nonn

This sequence gives all n at which positions the successive terms A219666(n-1) & A219666(n) in the infinite trunk of the factorial beanstalk differ only in one digit position in their factorial base representations (A007623).

Please see further comments and examples in A230410.

			14 is included, because A219666(13) = 40 = '1220' in factorial base representation, while A219666(14) = 46 = '1320' in factorial base, and they differ only by their third least significant digit.
16 is included, because A219666(15) = 48 = '2000' in factorial base representation, while A219666(16) = 52 = '2020' in factorial base, and they differ only by their second least significant digit.

Antti Karttunen, Table of n, a(n) for n = 1..17517

Subset: A231718. Cf. also A230410 and A258010 (first differences).

nn = 10^4; m = 1; While[m! < Floor[6 nn/5], m++]; m; f[n_] := IntegerDigits[n, MixedRadix[Reverse@ Range[2, m]]]; Position[#, 1] &[Function[w, Count[Subtract @@ Map[PadLeft[#, Max@ Map[Length, w]] &, w], k_ /; k != 0]]@ Map[f@ # &, {#1, #2}] & @@@ Partition[#, 2, 1] &@ TakeWhile[Reverse@ NestWhileList[# - Total@ f@ # &, Floor[6 nn/5], # > 0 &], # <= nn &]] // Flatten (* Michael De Vlieger, Jun 27 2016, Version 10.2 *)

For all n, A230406(a(n)) is one of the terms of A051683.

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).

Original entry on oeis.org

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)).

A226061 Partial sums of A219661.

Original entry on oeis.org

0, 1, 3, 8, 27, 110, 538, 3149, 21622, 172348, 1549896, 15401144, 168011252, 2003304293, 25928878272, 361788001015, 5411160126367, 86353882249911, 1464841397585335, 26323224850512719, 499551889319197565

Offset: 1

Antti Karttunen, May 28 2013

nonn

a(n) tells the position of (n!)-1 in A219666.

One less than A219665.
Cf. A219661, A219666.
Analogous sequence for binary system: A218600.
Cf. also A230410, A231719.

Accumulate@ Table[Length@ NestWhileList[# - Total@ IntegerDigits[#,
MixedRadix[Reverse@ Range[2, 120]]] &, (n + 1)! - 1, # > n! - 1 &] - 1, {n, 0, 8}] (* Michael De Vlieger, Jun 27 2016, Version 10.2 *)

a(n) = a(n-1) + A219661(n-1) with a(1) = 0.
a(n) = A219652(n!-1).
a(n) = A219665(n) - 1.

Terms a(16) - a(21) computed from the new terms of A219661 by Antti Karttunen, Jun 27 2016

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

Original entry on oeis.org

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, 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, 10, 11, 4, 5, 6, 7, 5, 5, 6, 8, 6, 8, 8, 7, 10, 12, 10, 11

Offset: 0

Antti Karttunen, Nov 09 2013

nonn

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

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

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

Cf. also A230418, A230410.

(define (A230406 n) (A034968 (A219666 n)))
;; Alternative definition:
(define (A230406 n) (if (zero? n) n (- (A219666 n) (A219666 (- n 1)))))

a(n) = A034968(A219666(n)).
a(0) = 0, and for n>=1, a(n) = A219666(n) - A219666(n-1).
a(A226061(n)) = A000217(n-1) for all n.

A231719 After zero, a(n) = largest m such that m! divides the difference between successive nodes A219666(n-1) and A219666(n) in the infinite trunk of the factorial beanstalk.

Original entry on oeis.org

0, 1, 1, 1, 2, 1, 2, 1, 3, 2, 1, 2, 1, 1, 3, 2, 2, 1, 3, 1, 2, 1, 3, 1, 1, 1, 1, 2, 2, 1, 2, 1, 1, 3, 2, 2, 1, 3, 1, 2, 1, 3, 1, 1, 1, 3, 1, 2, 1, 2, 2, 2, 1, 3, 1, 2, 1, 3, 1, 1, 1, 3, 2, 3, 2, 2, 1, 2, 1, 2, 1, 3, 1, 1, 1, 3, 2, 3, 2, 2, 1, 2, 3, 2, 1, 1, 1

Offset: 0

Antti Karttunen, Nov 12 2013

nonn

The first 4 occurs at n=2206. The first 5 occurs at n = 361788001015 = A226061(16).

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

Cf. A055881, A219666, A226061, A230406, A230410, A231717, A232096.

nn = 1200; m = 1; While[Factorial@ m < nn, m++]; m; t = TakeWhile[
Reverse@ NestList[# - Total@ IntegerDigits[#, MixedRadix[Reverse@ Range[2, m]]] &, nn, 182], # <= 1000 &]; {0}~Join~Table[SelectFirst[Reverse@ Range@ 10, Divisible[t[[n]] - t[[n - 1]], #!] &], {n, 2, 87}] (* Michael De Vlieger, Jun 27 2016, Version 10.2 *)

(define (A231719 n) (if (zero? n) n (A055881 (A230406 n))))

a(0)=0 and for n>=1, a(n) = A055881(A230406(n)).

For all n, a(A226061(n+1)) = A232096(n).

A230415 Square array T(i,j) giving the number of differing digits in the factorial base representations of i and j, for i >= 0, j >= 0, read by antidiagonals.

Original entry on oeis.org

0, 1, 1, 1, 0, 1, 2, 2, 2, 2, 1, 1, 0, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 1, 0, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 1, 0, 1, 2, 1, 2, 3, 3, 3, 3, 1, 1, 3, 3, 3, 3, 2, 2, 1, 2, 2, 0, 2, 2, 1, 2, 2, 3, 3, 2, 2, 3, 3, 3, 3, 2, 2, 3, 3, 1, 2, 2, 1, 2, 2, 0, 2, 2, 1, 2, 2, 1, 2, 2, 3, 3, 3, 3, 1, 1, 3, 3, 3, 3, 2, 2, 2, 1, 2, 2, 1, 2, 1, 0, 1, 2, 1, 2, 2, 1, 2

Offset: 0

Antti Karttunen, Nov 10 2013

This table relates to the factorial base representation (A007623) in a somewhat similar way as A101080 relates to the binary system. See A231713 for another analog.

			The top left corner of this square array begins as:
0, 1, 1, 2, 1, 2, 1, 2, 2, 3, 2, ...
1, 0, 2, 1, 2, 1, 2, 1, 3, 2, 3, ...
1, 2, 0, 1, 1, 2, 2, 3, 1, 2, 2, ...
2, 1, 1, 0, 2, 1, 3, 2, 2, 1, 3, ...
1, 2, 1, 2, 0, 1, 2, 3, 2, 3, 1, ...
2, 1, 2, 1, 1, 0, 3, 2, 3, 2, 2, ...
1, 2, 2, 3, 2, 3, 0, 1, 1, 2, 1, ...
2, 1, 3, 2, 3, 2, 1, 0, 2, 1, 2, ...
2, 3, 1, 2, 2, 3, 1, 2, 0, 1, 1, ...
3, 2, 2, 1, 3, 2, 2, 1, 1, 0, 2, ...
2, 3, 2, 3, 1, 2, 1, 2, 1, 2, 0, ...
...
For example, T(1,2) = T(2,1) = 2 as 1 has factorial base representation '...0001' and 2 has factorial base representation '...0010', and they differ by their two least significant digits.
On the other hand, T(3,5) = T(5,3) = 1, as 3 has factorial base representation '...0011' and 5 has factorial base representation '...0021', and they differ only by their second rightmost digit.
Note that as A007623(6)='100' and A007623(10)='120', we have T(6,10) = T(10,6) = 1 (instead of 2 as in A231713, cf. also its Example section), as here we count only the number of differing digit positions, but ignore the magnitudes of their differences.

Antti Karttunen, The first 121 antidiagonals of the table, flattened

The topmost row and the leftmost column: A060130.

Only the lower triangular region: A230417. Related arrays: A230419, A231713. Cf. also A101080, A084558, A230410.

nn = 14; m = 1; While[m! < nn, m++]; m; Table[Function[w, Count[Subtract @@ Map[PadLeft[#, Max@ Map[Length, w]] &, w], k_ /; k != 0]]@ Map[IntegerDigits[#, MixedRadix[Reverse@ Range[2, m]]] &, {i - j, j}], {i, 0, nn}, {j, 0, i}] // Flatten (* Michael De Vlieger, Jun 27 2016, Version 10.2 *)

(define (A230415 n) (A230415bi (A025581 n) (A002262 n)))
(define (A230415bi x y) (let loop ((x x) (y y) (i 2) (d 0)) (cond ((and (zero? x) (zero? y)) d) (else (loop (floor->exact (/ x i)) (floor->exact (/ y i)) (+ i 1) (+ d (if (= (modulo x i) (modulo y i)) 0 1)))))))

T(n,0) = T(0,n) = A060130(n).

Each entry T(i,j) <= A231713(i,j).

A231717 After a(0)=0, a(n) = A231713(A219666(n),A219666(n-1)).

Original entry on oeis.org

0, 1, 2, 2, 3, 3, 3, 3, 1, 6, 3, 3, 3, 2, 1, 6, 2, 3, 1, 3, 5, 3, 1, 3, 6, 2, 2, 3, 10, 3, 3, 3, 2, 1, 6, 2, 3, 1, 3, 5, 3, 1, 3, 6, 2, 1, 3, 5, 5, 3, 10, 2, 3, 1, 3, 5, 3, 1, 3, 6, 2, 1, 2, 4, 2, 4, 5, 3, 3, 9, 3, 1, 3, 6, 2, 1, 2, 4, 2, 4, 5, 3, 2, 4, 3, 10

Offset: 0

Antti Karttunen, Nov 12 2013

nonn

For all n, a(A226061(n+1)) = A232095(n). This works because at the positions given by each x=A226061(n+1), it holds that A219666(x) = (n+1)!-1, which has a factorial base representation (A007623) of (n,n-1,n-2,...,3,2,1) whose digit sum (A034968) is the n-th triangular number, A000217(n). This in turn is always a new record as at those points, in each significant digit position so far employed, a maximal digit value (for factorial number system) is used, and thus the preceding term, A219666(x-1) cannot have any larger digits in its factorial base representation, and so the differences between their digits (in matching positions) are all nonnegative.

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

A231718 gives the positions of ones.

Cf. also A230410, A231719, A232095.

(define (A231717 n) (if (zero? n) n (A231713bi (A219666 n) (A219666 (- n 1)))))

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

A232094 a(n) = A060130(A000217(n)); number of nonzero digits in factorial base representation (A007623) of 0+1+2+...+n.

Original entry on oeis.org

0, 1, 2, 1, 2, 3, 3, 2, 2, 4, 3, 2, 2, 3, 4, 1, 3, 5, 4, 4, 3, 5, 3, 3, 3, 4, 5, 2, 4, 4, 5, 3, 2, 5, 4, 3, 3, 4, 4, 3, 3, 5, 6, 5, 4, 5, 3, 3, 3, 4, 5, 3, 5, 6, 5, 3, 4, 6, 5, 4, 4, 5, 6, 3, 5, 6, 4, 4, 4, 5, 5, 4, 4, 5, 5, 4, 4, 4, 6, 5, 2, 6, 5, 3, 4, 4, 5

Offset: 0

Antti Karttunen, Nov 18 2013

The next 1 after a(1), a(3) and a(15) occurs at n=224, as A000217(224) = 25200 = 5 * 7!.

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

Cf. A000217, A007623, A060130, A226061, A230410, A232095.

a[n_] := Module[{k = n*(n+1)/2, m = 2, r, s = {}}, While[{k, r} = QuotientRemainder[k, m]; k != 0|| r != 0, AppendTo[s, r]; m++]; Count[s, ?(# > 0 &)]]; Array[a, 100, 0] (* _Amiram Eldar, Feb 07 2024 *)

(define (A232094 n) (A060130 (A000217 n)))

a(n) = A060130(A000217(n)).

a(n) = A230410(A226061(n+1)). [Not a practical way to compute this sequence. Please see comments at A230410.]

cp's OEIS Frontend

A230422 Positions of ones in A230410.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

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

A226061 Partial sums of A219661.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

Formula

Extensions

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

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Scheme

Formula

A231719 After zero, a(n) = largest m such that m! divides the difference between successive nodes A219666(n-1) and A219666(n) in the infinite trunk of the factorial beanstalk.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Scheme

Formula

A230415 Square array T(i,j) giving the number of differing digits in the factorial base representations of i and j, for i >= 0, j >= 0, read by antidiagonals.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Scheme

Formula

A231717 After a(0)=0, a(n) = A231713(A219666(n),A219666(n-1)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Scheme

Formula

A232094 a(n) = A060130(A000217(n)); number of nonzero digits in factorial base representation (A007623) of 0+1+2+...+n.

Views

Author

Keywords