login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A325273 Prime omicron of n!. 33

%I #14 Apr 18 2021 03:09:59

%S 0,0,1,2,2,2,3,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,

%T 2,2,2,2,2,3,3,3,3,3,2,2,2,2,2,2,2,3,3,3,3,2,2,2,3,3,3,3,2,2,2,2,2,2,

%U 2,3,3,3,3,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2

%N Prime omicron of n!.

%C We define the omega-sequence of n (row n of A323023) to have length A323014(n) = adjusted frequency depth of n, and the k-th term is Omega(red^{k-1}(n)), where Omega = A001222 and red^{k} is the k-th functional iteration of red = A181819, defined by red(n = p^i*...*q^j) = prime(i)*...*prime(j) = product of primes indexed by the prime exponents of n. For example, we have 180 -> 18 -> 6 -> 4 -> 3, so the omega-sequence of 180 is (5,3,2,2,1).

%C The prime omicron of n (A304465) is 0 if n is 1, 1 if n is prime, and otherwise the second-to-last part of the omega-sequence of n. For example, the prime omicron of 180 is 2.

%C Conjecture: all terms after a(10) = 4 are less than 4.

%C From _James Rayman_, Apr 17 2021: (Start)

%C The conjecture is false. a(3804) = 4. In fact, there are 91 values of n < 10000 such that a(n) = 4.

%C The first value of n such that a(n) = 5 is 37934. For any other n < 5*10^5, a(n) < 5. (End)

%H James Rayman, <a href="/A325273/b325273.txt">Table of n, a(n) for n = 0..10000</a>

%t omseq[n_Integer]:=If[n<=1,{},Total/@NestWhileList[Sort[Length/@Split[#]]&,Sort[Last/@FactorInteger[n]],Total[#]>1&]];

%t omicron[n_]:=Switch[n,1,0,_?PrimeQ,1,_,omseq[n][[-2]]];

%t Table[omicron[n!],{n,0,100}]

%o (Python)

%o from sympy.ntheory import *

%o def red(v):

%o r = {}

%o for i in v: r[i] = r.get(i, 0) + 1

%o return r

%o def omicron(v):

%o if len(v) == 0: return 0

%o if len(v) == 1: return v[0]

%o else: return omicron(list(red(v).values()))

%o f, a_list = {}, []

%o for i in range(101):

%o a_list.append(omicron(list(f.values())))

%o g = factorint(i+1)

%o for k in g: f[k] = f.get(k, 0) + g[k]

%o print(a_list) # _James Rayman_, Apr 17 2021

%Y a(n) = A055396(A325275(n)/2).

%Y Cf. A000142, A006939, A303555, A323023, A325238, A325272, A325274, A325275, A325276, A325277.

%Y Omega-sequence statistics: A001222 (first omega), A001221 (second omega), A071625 (third omega), A323022 (fourth omega), A304465 (second-to-last omega), A182850 or A323014 (length/frequency depth), A325248 (Heinz number), A325249 (sum).

%K nonn

%O 0,4

%A _Gus Wiseman_, Apr 18 2019

%E More terms from _James Rayman_, Apr 17 2021

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 25 14:58 EDT 2024. Contains 375439 sequences. (Running on oeis4.)