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.

Previous Showing 11-12 of 12 results.

A082881 Least value of A075860(j) when j runs through composite numbers between n-th and (n+1)-th primes. That is, the smallest fixed-point[=prime] reached by iteration of function A008472(=sum of prime factors) initiated with composite values between two consecutive primes.

Original entry on oeis.org

0, 2, 5, 2, 5, 2, 5, 7, 2, 7, 2, 2, 5, 2, 2, 2, 7, 2, 2, 5, 2, 3, 2, 5, 3, 13, 2, 5, 3, 2, 2, 2, 3, 2, 7, 5, 3, 13, 2, 3, 7, 2, 5, 3, 2, 2, 2, 2, 5, 7, 2, 7, 2, 2, 2, 2, 7, 2, 3, 2, 2, 2, 2, 5, 2, 2, 5, 2, 19, 2, 2, 2, 5, 2, 2, 3, 2, 3, 2, 2, 17, 2, 5, 5, 2, 2, 2, 7, 23, 2, 2, 3, 3, 3, 5, 2, 2, 19, 2, 5, 2, 3, 2
Offset: 1

Views

Author

Labos Elemer, Apr 16 2003

Keywords

Examples

			Between p(23)=83 and p(24)=89, the relevant fixed points are {5,13,2,2,13}, of which the smallest is 2=a(24).
		

Crossrefs

Programs

  • Mathematica
    ffi[x_] := Flatten[FactorInteger[x]]; lf[x_] := Length[FactorInteger[x]]; ba[x_] := Table[Part[ffi[x], 2*w-1], {w, 1, lf[x]}]; sopf[x_] := Apply[Plus, ba[x]]; Table[Min[Table[FixedPoint[sopf, w], {w, 1+Prime[n], Prime[n+1]-1}]], {n, 2, 103}]

Formula

a(n) = Min_{x=1+prime(n)..prime(n+1)-1} A075860(x).

A165442 Start with m, repeatedly find sum of prime factors until we reach a fixed point, then compute sum of numbers in trajectory except for m and the fixed point. If the resulting sum equals m, adjoin m to the sequence.

Original entry on oeis.org

20, 38, 74
Offset: 1

Views

Author

K. T. Lee (7x3(AT)21cn.com), Sep 19 2009

Keywords

Comments

No further terms below 10^13. Note that if the sum of the prime factors of a composite number equals itself, then it can only be 4.

Examples

			Take 20 as example, the sum of its prime factors is 9, then we move on until we get a prime, 9=3x3, 3+3=6, and 6=2x3, 2+3=5, add all the results in the process, 9+6+5=20. 20=9+6+5, 38=21+10+7, 74=39+16+8+6+5.
		

Crossrefs

Extensions

Edited by N. J. A. Sloane, Sep 20 2009
Previous Showing 11-12 of 12 results.