cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A260588 Number of prime factors, counted with multiplicity, of A173426(n) = concatenation of (1, 2, ..., n, n-1, ..., 1).

Original entry on oeis.org

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
Offset: 1

Views

Author

M. F. Hasler, Jul 29 2015

Keywords

Examples

			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.
		

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.

Programs

Formula

a(n) = A001222(A173426(n)).

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

A260589 Irregular table read by rows: n-th row lists the prime factors of A173426(n), with repetition.

Original entry on oeis.org

11, 11, 3, 3, 37, 37, 11, 11, 101, 101, 41, 41, 271, 271, 3, 3, 7, 7, 11, 11, 13, 13, 37, 37, 239, 239, 4649, 4649, 11, 11, 73, 73, 101, 101, 137, 137, 3, 3, 3, 3, 37, 37, 333667, 333667, 12345678910987654321, 7, 17636684157301569664903, 3, 3, 7, 7, 2799473675762179389994681, 1109, 4729
Offset: 1

Views

Author

M. F. Hasler, Jul 29 2015

Keywords

Comments

Row lengths are given by A260588(n). In particular, row n = 1 would have length 0, i.e., no element, because A173426(1) = 1 has no prime factors. Therefore the sequence can be considered to start with row n = 2. (The offset refers to the k-th element of the "flattened" sequence.)
For n = 1 through n = 9, A173426(n) is the square of the repunit 1...1 of length n, therefore every prime factor appears twice. This is no longer the case for n > 9.

Crossrefs

Programs

Formula

n | A173426(n) | factors = n-th row of this table
1 | 1 | []
2 | 121 | [11, 11]
3 | 12321 | [3, 3, 37, 37]
4 | 1234321 | [11, 11, 101, 101]
5 | 123454321 | [41, 41, 271, 271]
6 | 12345654321 | [3, 3, 7, 7, 11, 11, 13, 13, 37, 37]
Showing 1-2 of 2 results.