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.

A251362 Numbers n such that n is the concatenation of distinct prime factors of phi(n), in increasing order.

Original entry on oeis.org

25, 235741, 23517131, 274873357929, 2357131984859
Offset: 1

Views

Author

Jahangeer Kholdi, Dec 03 2014

Keywords

Comments

Numbers n such that n = A084317(A000010(n)). - Michel Marcus, Dec 06 2014

Examples

			25 is in the sequence since phi(25)=2^2*5,
235741 is in the sequence since phi(235741)=2^4*3^2*5*7*41,
23517131 is in the sequence since phi(23517131)=2^7*3*5^2*17*131.
		

Crossrefs

Programs

  • Mathematica
    a251362[n_Integer] := Rest@ Select[Range[n], # ==
    FromDigits[Flatten@IntegerDigits[First@Transpose@FactorInteger[EulerPhi[#]]]] &]; a251362[10^6] (* Michael De Vlieger, Dec 03 2014 *)

Extensions

a(4)-a(5) from Max Alekseyev, Feb 11 2025

A329025 If n = Product (p_j^k_j) then a(n) = concatenation (pi(p_j)), where pi = A000720.

Original entry on oeis.org

0, 1, 2, 1, 3, 12, 4, 1, 2, 13, 5, 12, 6, 14, 23, 1, 7, 12, 8, 13, 24, 15, 9, 12, 3, 16, 2, 14, 10, 123, 11, 1, 25, 17, 34, 12, 12, 18, 26, 13, 13, 124, 14, 15, 23, 19, 15, 12, 4, 13, 27, 16, 16, 12, 35, 14, 28, 110, 17, 123, 18, 111, 24, 1, 36, 125, 19, 17, 29, 134
Offset: 1

Views

Author

Ilya Gutkovskiy, Nov 02 2019

Keywords

Comments

Concatenate of indices of distinct prime factors of n, in increasing order.

Examples

			a(60) = a(2^2 * 3 * 5) = a(prime(1)^2 * prime(2) * prime(3)) = 123.
		

Crossrefs

Programs

  • Mathematica
    a[n_] := FromDigits[Flatten@IntegerDigits@(PrimePi[#[[1]]] & /@ FactorInteger[n])]; Table[a[n], {n, 1, 70}]

Formula

a(prime(n)^k) = n for k > 0.
Showing 1-2 of 2 results.