The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A260588 Number of prime factors, counted with multiplicity, of A173426(n) = concatenation of (1, 2, ..., n, n-1, ..., 1). 2
0, 2, 4, 4, 4, 10, 4, 8, 8, 1, 2, 5, 3, 6, 7, 4, 5, 8, 6, 2, 6, 3, 4, 9, 2, 6, 11, 2, 4, 10, 4, 9, 8, 6, 6, 12, 3, 6, 8, 4, 6, 7, 3, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = A001222(A173426(n)).
EXAMPLE
a(2) = 2 since A173426(2) = 121 = 11*11 has twice the factor 11.
a(21) = 6 since A173426(21) = 3 * 3 * 7 * 828703 * 94364768151913037621 * 250591098443370396365457961250972909.
PROG
(PARI) a(n)=bigomega(A173426(n))
CROSSREFS
See A260587 for the variant where only distinct prime factors are counted.
See also A075023 and A075024 for the smallest and largest prime factor of the terms.
Cf. A001222.
Sequence in context: A299768 A021413 A082855 * A107058 A332336 A101449
KEYWORD
nonn,base,hard,more
AUTHOR
M. F. Hasler, Jul 29 2015
EXTENSIONS
Terms beyond a(30) via factorization results by Serge Batalov, added by M. F. Hasler, Jul 30 2015
a(38)-a(44) added using factordb.com by Jinyuan Wang, Mar 05 2020
STATUS
approved

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 May 14 12:38 EDT 2024. Contains 372533 sequences. (Running on oeis4.)