A232744 -id:A232744 - cp's OEIS frontend

A055881 a(n) = largest m such that m! divides n.

1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 3, 1, 2, 1

Offset: 1

Leroy Quet and Labos Elemer, Jul 16 2000

Number of factorial divisors of n. - Amarnath Murthy, Oct 19 2002
The sequence may be constructed as follows. Step 1: start with 1, concatenate and add +1 to last term gives: 1,2. Step 2: 2 is the last term so concatenate twice those terms and add +1 to last term gives: 1, 2, 1, 2, 1, 3 we get 6 terms. Step 3: 3 is the last term, concatenate 3 times those 6 terms and add +1 to last term gives: 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 4, iterates. At k-th step we obtain (k+1)! terms. - Benoit Cloitre, Mar 11 2003
From Benoit Cloitre, Aug 17 2007, edited by M. F. Hasler, Jun 28 2016: (Start)
Another way to construct the sequence: start from an infinite series of 1's:
   1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ... Replace every second 1 by a 2 giving:
   1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, ... Replace every third 2 by a 3 giving:
   1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, ... Replace every fourth 3 by a 4 etc. (End)
This sequence is the fixed point, starting with 1, of the morphism m, where m(1) = 1, 2, and for k > 1, m(k) is the concatenation of m(k - 1), the sequence up to the first k, and k + 1. Thus m(2) = 1, 2, 1, 3; m(3) = 1, 2, 1, 3, 1, 2, 1, 2, 1, 4; m(4) = 1, 2, 1, 3, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 5, etc. - Franklin T. Adams-Watters, Jun 10 2009
All permutations of n elements can be listed as follows: Start with the (arbitrary) permutation P(0), and to obtain P(n + 1), reverse the first a(n) + 1 elements in P(n). The last permutation is the reversal of the first, so the path is a cycle in the underlying graph. See example and fxtbook link. - Joerg Arndt, Jul 16 2011
Positions of rightmost change with incrementing rising factorial numbers, see example. - Joerg Arndt, Dec 15 2012
Records appear at factorials. - Robert G. Wilson v, Dec 21 2012
One more than the number of trailing zeros (A230403(n)) in the factorial base representation of n (A007623(n)). - Antti Karttunen, Nov 18 2013
A062356(n) and a(n) coincide quite often. - R. J. Cano, Aug 04 2014
For n>0 and 1<=j<=(n+1)!-1, (n+1)^2-1=A005563(n) is the number of times that a(j)=n-1. - R. J. Cano, Dec 23 2016

			a(12) = 3 because 3! is highest factorial to divide 12.
From _Joerg Arndt_, Jul 16 2011: (Start)
All permutations of 4 elements via prefix reversals:
   n:   permutation  a(n)+1
   0:   [ 0 1 2 3 ]  -
   1:   [ 1 0 2 3 ]  2
   2:   [ 2 0 1 3 ]  3
   3:   [ 0 2 1 3 ]  2
   4:   [ 1 2 0 3 ]  3
   5:   [ 2 1 0 3 ]  2
   6:   [ 3 0 1 2 ]  4
   7:   [ 0 3 1 2 ]  2
   8:   [ 1 3 0 2 ]  3
   9:   [ 3 1 0 2 ]  2
  10:   [ 0 1 3 2 ]  3
  11:   [ 1 0 3 2 ]  2
  12:   [ 2 3 0 1 ]  4
  13:   [ 3 2 0 1 ]  2
  14:   [ 0 2 3 1 ]  3
  15:   [ 2 0 3 1 ]  2
  16:   [ 3 0 2 1 ]  3
  17:   [ 0 3 2 1 ]  2
  18:   [ 1 2 3 0 ]  4
  19:   [ 2 1 3 0 ]  2
  20:   [ 3 1 2 0 ]  3
  21:   [ 1 3 2 0 ]  2
  22:   [ 2 3 1 0 ]  3
  23:   [ 3 2 1 0 ]  2
(End)
From _Joerg Arndt_, Dec 15 2012: (Start)
The first few rising factorial numbers (dots for zeros) with 4 digits and the positions of the rightmost change with incrementing are:
  [ 0]    [ . . . . ]   -
  [ 1]    [ 1 . . . ]   1
  [ 2]    [ . 1 . . ]   2
  [ 3]    [ 1 1 . . ]   1
  [ 4]    [ . 2 . . ]   2
  [ 5]    [ 1 2 . . ]   1
  [ 6]    [ . . 1 . ]   3
  [ 7]    [ 1 . 1 . ]   1
  [ 8]    [ . 1 1 . ]   2
  [ 9]    [ 1 1 1 . ]   1
  [10]    [ . 2 1 . ]   2
  [11]    [ 1 2 1 . ]   1
  [12]    [ . . 2 . ]   3
  [13]    [ 1 . 2 . ]   1
  [14]    [ . 1 2 . ]   2
  [15]    [ 1 1 2 . ]   1
  [16]    [ . 2 2 . ]   2
  [17]    [ 1 2 2 . ]   1
  [18]    [ . . 3 . ]   3
  [19]    [ 1 . 3 . ]   1
  [20]    [ . 1 3 . ]   2
  [21]    [ 1 1 3 . ]   1
  [22]    [ . 2 3 . ]   2
  [23]    [ 1 2 3 . ]   1
  [24]    [ . . . 1 ]   4
  [25]    [ 1 . . 1 ]   1
  [26]    [ . 1 . 1 ]   2
(End)

Antti Karttunen, Table of n, a(n) for n = 1..10080
Joerg Arndt, Matters Computational (The Fxtbook), section 10.4, pp.245-248 (prefix reversals); section 10.5, pp. 248-250 (Heap's method).
R. J. Cano, Alternative sequencer (PARI/GP).
Claude Lenormand, Comments on this sequence.
József Sándor, On Additive Analogues of Certain Arithmetic Smarandache Functions.
Index entries for sequences related to factorial base representation.

Cf. A055874, A055926, A055770, A062356, A073575, A091131, A230403, A230404, A230405, A076733, A232096, A232098, A233285, A233267, A233269, A231719, A232741, A232742, A232743, A232744, A232745, A060832 (partial sums).
This sequence occurs also in the next to middle diagonals of A230415 and as the second rightmost column of triangle A230417.
Other sequences related to factorial base representation (A007623): A034968, A084558, A099563, A060130, A227130, A227132, A227148, A227149, A153880.
Analogous sequence for binary (base-2) representation: A001511.

Table[Length[Intersection[Divisors[n], Range[5]!]], {n, 125}] (* Alonso del Arte, Dec 10 2012 *)
f[n_] := Block[{m = 1}, While[Mod[n, m!] == 0, m++]; m - 1]; Array[f, 105] (* Robert G. Wilson v, Dec 21 2012 *)

PARI
```
See Cano link.
```

n=5; f=n!; x='x+O('x^f); Vec(sum(k=1,n,x^(k!)/(1-x^(k!)))) \\ Joerg Arndt, Jan 28 2014

a(n)=for(k=2,n+1,if(n%k, return(k-1),n/=k)) \\ Charles R Greathouse IV, May 28 2015

(define (A055881 n) (let loop ((n n) (i 2)) (cond ((not (zero? (modulo n i))) (- i 1)) (else (loop (/ n i) (+ 1 i))))))

G.f.: Sum_{k > 0} x^(k!)/(1 - x^(k!)). - Vladeta Jovovic, Dec 13 2002
a(n) = A230403(n)+1. - Antti Karttunen, Nov 18 2013
a(n) = A230415(n-1,n) = A230415(n,n-1) = A230417(n,n-1). - Antti Karttunen, Nov 19 2013
a(m!+n) = a(n) if 1 <= n <= m*m! - 1 = A001563(m) - 1. - R. J. Cano, Jun 27 2016
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = e - 1 (A091131). - Amiram Eldar, Jul 23 2022

A068996 Decimal expansion of 1 - 1/e.

Original entry on oeis.org

6, 3, 2, 1, 2, 0, 5, 5, 8, 8, 2, 8, 5, 5, 7, 6, 7, 8, 4, 0, 4, 4, 7, 6, 2, 2, 9, 8, 3, 8, 5, 3, 9, 1, 3, 2, 5, 5, 4, 1, 8, 8, 8, 6, 8, 9, 6, 8, 2, 3, 2, 1, 6, 5, 4, 9, 2, 1, 6, 3, 1, 9, 8, 3, 0, 2, 5, 3, 8, 5, 0, 4, 2, 5, 5, 1, 0, 0, 1, 9, 6, 6, 4, 2, 8, 5, 2, 7, 2, 5, 6, 5, 4, 0, 8, 0, 3, 5, 6

Offset: 0

N. J. A. Sloane, Apr 08 2002

From the "derangements" problem: this is the probability that if a large number of people are given their hats at random, at least one person gets their own hat.
1-1/e is the limit to which (1 - !n/n!) {= 1 - A000166(n)/A000142(n) = A002467(n)/A000142(n)} converges as n tends to infinity. - Lekraj Beedassy, Apr 14 2005
Also, this is lim_{n->inf} P(n), where P(n) is the probability that a random rooted forest on [n] is not connected. - Washington Bomfim, Nov 01 2010
Also equals the mode of a Gompertz distribution when the shape parameter is less than 1. - Jean-François Alcover, Apr 17 2013
The asymptotic density of numbers with an even number of trailing zeros in their factorial base representation (A232744). - Amiram Eldar, Feb 26 2021

			0.6321205588285576784044762...

Steven R. Finch, Mathematical Constants, Cambridge, 2003, Section 1.3, pp. 12-17.
Anders Hald, A History of Probability and Statistics and Their Applications before 1750, Wiley, NY, 1990 (Chapter 19).
John Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 65.

Brian Conrey and Tom Davis, Derangements.
Brady Haran and Tom Crawford, A Problem with Infinite Hotel Keys, YouTube Numberphile video, 2025.
MathOverflow, What is the effect of adding 1/2 to a continued fraction?.
Jonathan Sondow and Eric Weisstein, e, MathWorld.
Bala Subramanian, Why time constant is 63.2% not a 50 or 70%? (2018).
Index entries for transcendental numbers

Cf. A000166, A068985, A091131, A185393, A232744.

evalf[140](1-exp(-1));  # Alois P. Heinz, May 16 2025

RealDigits[1 - 1/E, 10, 100][[1]] (* Alonso del Arte, Jul 06 2012 *)

1 - exp(-1) \\ Michel Marcus, Mar 04 2016

Equals Integral_{x = 0 .. 1} exp(-x) dx. - Alonso del Arte, Jul 06 2012
Equals -Sum_{k>=1} (-1)^k/k!. - Bruno Berselli, May 13 2013
Equals Sum_{k>=0} 1/((2*k+2)*(2*k)!). - Fred Daniel Kline, Mar 03 2016
From Peter Bala, Nov 27 2019: (Start)
1 - 1/e =  Sum_{n >= 0} n!/(A(n)*A(n+1)), where A(n) = A000522(n).
Continued fraction expansion: [0; 1, 1, 1, 2, 1, 1, 4, 1, 1, 6, 1, 1, 8, ...].
Related continued fraction expansions include
2*(1 - 1/e) = [1; 3, 1, 3, 1, 1, 1, 3, 3, 3, 1, 3, 1, 3, 5, 3, 1, 5, ..., 1, 3, 2*n + 1, 3, 1, 2*n + 1, ...];
(1/2)*(1 - 1/e) = [0; 3, 6, 10, 14, 18, ..., 4*n + 2, ...];
4*(1 - 1/e) = [2; 1, 1, 8, 3, 1, 1, 1, 1, 7, 1, 1, 2, 1, 1, 1, 2, 7, 1, 2, 2, 1, 1, 1, 3, ..., 7, 1, n, 2, 1, 1, 1, n+1, ...];
(1/4)*(1 - 1/e) = [0; 6, 3, 20, 7, 36, 11, 52, 15, ..., 16*n + 4, 4*n + 3, ...]. (End)
Equals Integral_{x=0..1} x * cosh(x) dx. - Amiram Eldar, Aug 14 2020
Equals A091131/e. - Hugo Pfoertner, Aug 20 2024

A342051 Numbers k which have an even number of trailing zeros in their primorial base representation A049345(k).

Original entry on oeis.org

1, 3, 5, 6, 7, 9, 11, 12, 13, 15, 17, 18, 19, 21, 23, 24, 25, 27, 29, 31, 33, 35, 36, 37, 39, 41, 42, 43, 45, 47, 48, 49, 51, 53, 54, 55, 57, 59, 61, 63, 65, 66, 67, 69, 71, 72, 73, 75, 77, 78, 79, 81, 83, 84, 85, 87, 89, 91, 93, 95, 96, 97, 99, 101, 102, 103

Offset: 1

Amiram Eldar, Feb 26 2021

Numbers k such that A276084(k) is even.
The number of terms not exceeding A002110(m) for m>=1 is A002110(m) * (1 - Sum_{k=1..m}(-1)^k/A002110(k)) = 1, 4, 19, 134, 1473, 19150, 325549 ...
The asymptotic density of this sequence is Sum_{k>=0} (-1)^k/A002110(k) = 0.637693... = 1 - A132120.
Also Heinz numbers of partitions with odd least gap. The least gap (mex or minimal excludant) of a partition is the least positive integer that is not a part. The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k), giving a bijective correspondence between positive integers and integer partitions. - Gus Wiseman, Apr 23 2021

			1 is a term since A049345(1) = 1 has 0 trailing zero.
6 is a term since A049345(6) = 100 has 2 trailing zeros.
From _Gus Wiseman_, Apr 23 2021: (Start)
The sequence of terms together with their prime indices begins:
     1: {}           25: {3,3}          51: {2,7}
     3: {2}          27: {2,2,2}        53: {16}
     5: {3}          29: {10}           54: {1,2,2,2}
     6: {1,2}        31: {11}           55: {3,5}
     7: {4}          33: {2,5}          57: {2,8}
     9: {2,2}        35: {3,4}          59: {17}
    11: {5}          36: {1,1,2,2}      61: {18}
    12: {1,1,2}      37: {12}           63: {2,2,4}
    13: {6}          39: {2,6}          65: {3,6}
    15: {2,3}        41: {13}           66: {1,2,5}
    17: {7}          42: {1,2,4}        67: {19}
    18: {1,2,2}      43: {14}           69: {2,9}
    19: {8}          45: {2,2,3}        71: {20}
    21: {2,4}        47: {15}           72: {1,1,1,2,2}
    23: {9}          48: {1,1,1,1,2}    73: {21}
    24: {1,1,1,2}    49: {4,4}          75: {2,3,3}
(End)

Amiram Eldar, Table of n, a(n) for n = 1..10000
George E. Andrews and David Newman, Partitions and the Minimal Excludant, Annals of Combinatorics, Volume 23, May 2019, Pages 249-254.
Brian Hopkins, James A. Sellers, and Dennis Stanton, Dyson's Crank and the Mex of Integer Partitions, arXiv:2009.10873 [math.CO], 2020.
Wikipedia, Mex (mathematics)

Cf. A002110, A049345, A132120, A276084.
Complement of A342050.
A099788 is subsequence.
Analogous sequences: A000201 (Zeckendorf representation), A003159 (binary), A007417 (ternary), A232744 (factorial base).
The version for reversed binary expansion is A121539.
Positions of odd terms in A257993.
A000070 counts partitions with a selected part.
A056239 adds up prime indices, row sums of A112798.
A073491 lists numbers with gap-free prime indices.
A079067 counts gaps in prime indices.
A238709 counts partitions by sum and least difference.
A339662 gives greatest gap in prime indices.
Cf. A001223, A005408, A026794, A029707, A047235, A079068, A079523, A286469, A286470, A325351.

seq[max_] := Module[{bases = Prime@Range[max, 1, -1], nmax}, nmax = Times @@ bases - 1; Select[Range[nmax], EvenQ @ LengthWhile[Reverse @ IntegerDigits[#, MixedRadix[bases]], #1 == 0 &] &]]; seq[4]
Select[Range[100],OddQ[Min@@Complement[Range[PrimeNu[#]+1],PrimePi/@First/@FactorInteger[#]]]&] (* Gus Wiseman, Apr 23 2021 *)

A055926 Numbers k such that {largest m such that 1, 2, ..., m divide k} is different from {largest m such that m! divides k}; numbers k which are either odd multiples of 12 or the largest m such that (m-1)! divides k is a composite number > 5.

Original entry on oeis.org

12, 36, 60, 84, 108, 120, 132, 156, 180, 204, 228, 240, 252, 276, 300, 324, 348, 360, 372, 396, 420, 444, 468, 480, 492, 516, 540, 564, 588, 600, 612, 636, 660, 684, 708, 732, 756, 780, 804, 828, 840, 852, 876, 900, 924, 948, 960, 972, 996, 1020, 1044, 1068

Offset: 1

Leroy Quet, Jul 16 2000

From Antti Karttunen, Nov 20 - Dec 06 2013: (Start)
This sequence has several interpretations:
Numbers k such that A055874(k) differs from A055881(k). [Leroy Quet's original definition of the sequence. Note that A055874(k) >= A055881(k) for all k.]
Numbers k such that {largest m such that m! divides k^2} is different from {largest m such that m! divides k}, i.e., numbers k for which A232098(k) > A055881(k).
Numbers k which are either 12 times an odd number (A073762) or the largest m such that (m-1)! divides k is a composite number > 5 (A232743).
Please see my attached notes for the proof of the equivalence of these interpretations.
Additional implications based on that proof:
A232099 is a subset of this sequence.
A055881(a(n))+1 is always composite. In the range n = 1..17712, only values 4, 6, 8, 9 and 10 occur.
The new definition can be also rephrased by saying that the sequence contains all the positive integers k whose factorial base representation of (A007623(k)) either ends as '...200' (in which case k is an odd multiple of 12, 12 = '200', 36 = '1200', 60 = '2200', ...) or the number of trailing zeros + 2 in that representation is a composite number greater than or equal to 6, e.g. 120 = '10000' (in other words, A055881(k) is one of the terms of A072668 after the initial 3). Together these conditions also imply that all the terms are divisible by 12.
(End)

			12 is included because 3! is the largest factorial to divide 12, but 1, 2, 3 and 4 all divide 12. Equally, 12 is included because it is one of the terms of A073762, or equally, because its factorial base representation ends with digits '...200': A007623(12) = 200.
840 (= 3*5*7*8) is included because the largest factorial which divides 840 is 5! (840 = 7*120), but all positive integers up to 8 divide 840. Equally, 840 is included because it is one of the terms of A232743 as 5+1 = 6 is a composite number larger than 5. Note that A007623(840) = 110000.

Antti Karttunen, Table of n, a(n) for n = 1..17712
Antti Karttunen, A proof for the equivalence of three alternative definitions of A055926
Wikipedia, Wilson's theorem (See the section "Composite modulus")

Union of A073762 and A232743. Equivalently, setwise difference of A232742 and A017593. Subset: A232099.

Cf. A055874, A055881, A072668, A232098, A232100, A232741, A232744, A232745.

More terms from Antti Karttunen, Dec 01 2013

A232745 Numbers k for which the largest m such that m! divides k is even.

Original entry on oeis.org

2, 4, 8, 10, 14, 16, 20, 22, 24, 26, 28, 32, 34, 38, 40, 44, 46, 48, 50, 52, 56, 58, 62, 64, 68, 70, 72, 74, 76, 80, 82, 86, 88, 92, 94, 96, 98, 100, 104, 106, 110, 112, 116, 118, 122, 124, 128, 130, 134, 136, 140, 142, 144, 146, 148, 152, 154, 158, 160, 164

Offset: 1

Antti Karttunen, Dec 01 2013

nonn

Numbers k for which A055881(k) is even.
Equally: Numbers k which have an odd number of the trailing zeros in their factorial base representation A007623(k).
The sequence can be described in the following manner: Sequence includes all multiples of 2! (even numbers), except that it excludes from those the multiples of 3! (6), except that it includes the multiples of 4! (24), except that it excludes the multiples of 5! (120), except that it includes the multiples of 6! (720), except that it excludes the multiples of 7! (5040), except that it includes the multiples of 8! (40320), except that it excludes the multiples of 9! (362880), except that it includes the multiples of 10! (3628800), except that ..., ad infinitum.
The number of terms not exceeding m! for m>=1 is A000166(m). The asymptotic density of this sequence is 1/e (A068985). - Amiram Eldar, Feb 26 2021

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

Complement: A232744.
b(n) = A153880(A232744(n)) gives a subset of this sequence.
Cf. also A055881, A007623, A232741-A232743.
Analogous sequences for binary system: A003159 & A036554.
Cf. A000166, A068985.

seq[max_] := Select[Range[max!], OddQ @ LengthWhile[Reverse @ IntegerDigits[#, MixedRadix[Range[max, 2, -1]]], #1 == 0 &] &]; seq[5] (* Amiram Eldar, Feb 26 2021 *)

A232741 Numbers n for which the largest m such that (m-1)! divides n is a prime.

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 55, 56, 57, 58, 59, 61, 62, 63, 64, 65, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76

Offset: 1

Antti Karttunen, Dec 01 2013

nonn

Numbers n for which A055881(n) is one of the terms of A006093.
Equally: Numbers n for which {the number of the trailing zeros in their factorial base representation A007623(n)} + 2 is a prime.
The sequence can be described in the following manner: Sequence includes all multiples of 1! and 2! (odd and even numbers), except that it excludes from those the multiples of 3! (6), except that it includes the multiples of 4! (24), except that it excludes the multiples of 5! (120), except that it includes the multiples of 6! (720), except that it excludes the multiples of 7! (5040) (and also those of 8! and 9!, because here 8+1 = 9 is the first odd composite), except that it includes the multiples of 10!, but excludes the multiples of 11!, but includes the multiples of 12!, but excludes the multiples of 13! (and also of 14! and 15!, because 14-16 are all composites), but includes the multiples of 16!, and so on, ad infinitum.

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

Complement: A232742. Cf. A055926, A232744-A232745, A007623, A055881, A230403.

A232743 Numbers n for which the largest m such that (m-1)! divides n is a composite number > 5.

Original entry on oeis.org

120, 240, 360, 480, 600, 840, 960, 1080, 1200, 1320, 1560, 1680, 1800, 1920, 2040, 2280, 2400, 2520, 2640, 2760, 3000, 3120, 3240, 3360, 3480, 3720, 3840, 3960, 4080, 4200, 4440, 4560, 4680, 4800, 4920, 5040, 5160, 5280, 5400, 5520, 5640, 5880, 6000, 6120, 6240

Offset: 1

Antti Karttunen, Dec 01 2013

nonn

Numbers n for which A055881(n)>4 and is one of the terms of A072668.
Numbers n for which two plus the number of the trailing zeros in their factorial base representation A007623(n) is a composite number larger than 5.
All terms are multiples of 120. Specifically, these are all those terms of A232742 which are divisible by 120 (or equally: 24).
Please see also the comments in A055926, whose subset this sequence is.

			120 is included because A055881(120)=5 and 5+1 is a composite number larger than 5. Note that A007623(120) = '10000', with four trailing zeros.
720 is the first missing multiple of 120, as A055881(720)=6 and 7 is a prime, not composite, so 720 is not included in this sequence. Note that A007623(720) = '100000', with five trailing zeros, and 5+2 is not a composite.
120960 (= 3*8!) is included because A055881(120960)=8 and 9 is a composite number larger than 5. Note that A007623(120960) = '30000000', with seven trailing zeros.

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

Subset of both A232742 and A055926.

Cf. also A007623, A055881, A230403, A232744-A232745.

A232742 Numbers n for which the largest m such that (m-1)! divides n is a composite.

Original entry on oeis.org

6, 12, 18, 30, 36, 42, 54, 60, 66, 78, 84, 90, 102, 108, 114, 120, 126, 132, 138, 150, 156, 162, 174, 180, 186, 198, 204, 210, 222, 228, 234, 240, 246, 252, 258, 270, 276, 282, 294, 300, 306, 318, 324, 330, 342, 348, 354, 360, 366, 372, 378, 390, 396, 402, 414

Offset: 1

Antti Karttunen, Dec 01 2013

nonn

Numbers n for which A055881(n) is one of the terms of A072668.
Equally: numbers n for which {the number of the trailing zeros in their factorial base representation A007623(n)} + 2 is a composite number.
All terms are divisible by 6.
The sequence can be described in the following manner: Sequence includes all multiples of 3!, except that it excludes from those the multiples of 4! (24), except that it includes the multiples of 5! (120), except that it excludes the multiples of 6! (720), except that it includes the multiples of 7! (5040) (and also those of 8! and 9!, because here 8+1 = 9 is the first odd composite), of which it however excludes the multiples of 10!, except that it includes the multiples of 11!, but excludes the multiples of 12!, but includes the multiples of 13! (and 14! and 15!, because 14-16 are all composites), but excludes the multiples of 16!, and so on, ad infinitum.

			6 is included because A055881(6)=3 and 3+1 is a composite number.
24 is the first excluded multiple of 6, as A055881(24)=4 and 5 is a prime, not composite, so 24 is not included in this sequence.
120 is the first included multiple of 24, as A055881(120)=5 and 6 is a composite.

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

Complement: A232741. Subset: A232743.

Cf. A055926, A232744-A232745, A007623, A055881, A230403.

A227187 Numbers n whose factorial base representation A007623(n) contains at least one nonleading zero. (Zero is also included as a(0)).

Original entry on oeis.org

0, 2, 4, 6, 7, 8, 10, 12, 13, 14, 16, 18, 19, 20, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 34, 36, 37, 38, 40, 42, 43, 44, 46, 48, 49, 50, 51, 52, 53, 54, 55, 56, 58, 60, 61, 62, 64, 66, 67, 68, 70, 72, 73, 74, 75, 76, 77, 78, 79, 80, 82, 84, 85, 86, 88, 90, 91

Offset: 0

Antti Karttunen, Jul 04 2013

Antti Karttunen, Table of n, a(n) for n = 0..10000
Index entries for sequences related to factorial base representation.

Complement: A227157.
The sequence gives all positions n where A208575 is zero and all terms where A257510 (also A257260) are nonzeros.
Cf. A232745 (a subsequence), A232744.
Cf. also A007623, A132371, A153880, A227130, A227132, A256450 (numbers with at least one 1 in their factorial representation).

q[n_] := Module[{k = n, m = 2, r, s = {}}, While[{k, r} = QuotientRemainder[k, m]; k != 0|| r != 0, AppendTo[s, r]; m++]; MemberQ[s, 0]]; q[0] = True; Select[Range[0, 100], q] (* Amiram Eldar, Feb 07 2024 *)

a(0) = 0, a(1) = 2, and for n > 1, if a(n-1) is odd or A257510(a(n-1)) > 1, then a(n) = a(n-1) + 1, otherwise a(n) = a(n-1) + 2. - Antti Karttunen, Apr 29 2015
Other identities:
For all n >= 2, a(A132371(n)) = A000142(n) = n! [See comments in A227157.]

cp's OEIS Frontend

A055881 a(n) = largest m such that m! divides n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

PARI

Scheme

Formula

A068996 Decimal expansion of 1 - 1/e.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A342051 Numbers k which have an even number of trailing zeros in their primorial base representation A049345(k).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A055926 Numbers k such that {largest m such that 1, 2, ..., m divide k} is different from {largest m such that m! divides k}; numbers k which are either odd multiples of 12 or the largest m such that (m-1)! divides k is a composite number > 5.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions

A232745 Numbers k for which the largest m such that m! divides k is even.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

A232741 Numbers n for which the largest m such that (m-1)! divides n is a prime.

Views

Author

Keywords

Comments

Links

Crossrefs

A232743 Numbers n for which the largest m such that (m-1)! divides n is a composite number > 5.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A232742 Numbers n for which the largest m such that (m-1)! divides n is a composite.

Views

Author

Keywords

Comments

Examples

Links