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.

A238746 Number of distinct prime signatures that occur among the divisors of the n-th prime signature number (A025487(n)).

Original entry on oeis.org

1, 2, 3, 3, 4, 5, 5, 7, 4, 6, 6, 9, 7, 7, 9, 11, 10, 8, 12, 9, 13, 5, 10, 13, 9, 15, 14, 15, 9, 14, 16, 10, 18, 19, 17, 13, 18, 10, 19, 11, 16, 21, 12, 15, 24, 19, 17, 22, 16, 22, 12, 23, 24, 6, 19, 20, 29, 21, 21, 26, 22, 25, 13, 30, 27, 11, 26, 25, 19, 34
Offset: 1

Views

Author

Matthew Vandermast, Apr 28 2014

Keywords

Comments

Also the number of members of A025487 that divide A025487(n).

Examples

			5 members of A025487 divide A025487(6) = 12 (namely, 1, 2, 4, 6 and 12); therefore, a(6) = 5.
		

Crossrefs

Rearrangement of A115728, A115729 and A238690.
A116473(n) is the number of times n appears in the sequence.

Programs

  • Mathematica
    lpsQ[n_] := n == 1 || (Max@ Differences[(f = FactorInteger[n])[[;;,2]]] < 1 && f[[-1, 1]] == Prime[Length[f]]); lps = Select[Range[6000], lpsQ]; c[n_] := Count[Divisors[n], ?(MemberQ[lps, #] &)]; c /@ lps  (* _Amiram Eldar, Jan 21 2024 *)

Formula

a(n) = A085082(A025487(n)) = A085082(A181822(n)).
a(n) = A322584(A025487(n)). - Amiram Eldar, Jan 21 2024