login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064802 a(n) = Min { m > n | prime factorizations of m and n differ in one factor only}, a(1) = 1. 3

%I

%S 1,3,5,6,7,9,11,12,15,14,13,18,17,21,21,24,19,27,23,28,33,26,29,36,35,

%T 34,45,42,31,42,37,48,39,38,49,54,41,46,51,56,43,63,47,52,63,58,53,72,

%U 77,70,57,68,59,81,65,84,69,62,61,84,67,74,99,96,85,78,71,76,87,98,73

%N a(n) = Min { m > n | prime factorizations of m and n differ in one factor only}, a(1) = 1.

%C a(A000040(k)) = A000040(k + 1).

%C A094457 gives next smaller comparable number, replacing the prime factor 2 with 1. - _Michael De Vlieger_, Jan 31 2015

%H Michael De Vlieger, <a href="/A064802/b064802.txt">Table of n, a(n) for n = 1..10000</a>

%e 20 = 2 * 2 * 5: as 2 * 3 * 5 > 2 * 2 * 7 = 28 we have a(20) = 28.

%t f[n_] := Block[{g}, g[x_] := Flatten[Table[#1, {#2}] & @@@ FactorInteger@ x]; If[n == 1, 1, Min[Times @@ MapAt[NextPrime, g[n], #] & /@ Range[Length@ g[n]]]]]; Array[f, 71] (* _Michael De Vlieger_, Jan 31 2015 *)

%Y Cf. A000040, A094457.

%K nonn

%O 1,2

%A _Reinhard Zumkeller_, Oct 21 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 15 19:25 EDT 2019. Contains 328037 sequences. (Running on oeis4.)