login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A071140 Numbers n such that sum of distinct primes dividing n is divisible by largest prime dividing n; n is neither a prime, nor a true power of prime. 7

%I #23 Jul 19 2017 08:27:29

%S 30,60,70,90,120,140,150,180,240,270,280,286,300,350,360,450,480,490,

%T 540,560,572,600,646,700,720,750,810,900,960,980,1080,1120,1144,1200,

%U 1292,1350,1400,1440,1500,1620,1750,1798,1800,1920,1960,2160,2240,2250

%N Numbers n such that sum of distinct primes dividing n is divisible by largest prime dividing n; n is neither a prime, nor a true power of prime.

%C a(n) are the numbers such that the difference between the largest and the smallest prime divisor equals the sum of the other distinct prime divisors. - _Michel Lagneau_, Nov 13 2011

%C The statement above is only true for 966 of the first 1000 terms. The first counterexample is a(140) = 15015. - _Donovan Johnson_, Apr 10 2013

%C Lagneau's definition can be simplified to the largest prime divisor equals the sum of the other distinct prime divisors. - _Christian N. K. Anderson_, Apr 15 2013

%H Donovan Johnson, <a href="/A071140/b071140.txt">Table of n, a(n) for n = 1..1000</a>

%F A008472(n)/A006530(n) is integer and n has at least 3 distinct prime factors.

%F A008472(a(n)) mod A006530(a(n)) = 0 and A010055(a(n)) = 0. - _Reinhard Zumkeller_, Apr 18 2013

%e n = 70 = 2*5*7 has a form of 2pq, where p and q are twin primes; n = 3135 = 3*5*11*19, sum = 3+5+11+19 = 38 = 2*19, divisible by 19.

%t ffi[x_] := Flatten[FactorInteger[x]] lf[x_] := Length[FactorInteger[x]] ba[x_] := Table[Part[ffi[x], 2*w-1], {w, 1, lf[x]}] sb[x_] := Apply[Plus, ba[x]] ma[x_] := Part[Reverse[Flatten[FactorInteger[x]]], 2] Do[s=sb[n]/ma[n]; If[IntegerQ[s]&&Greater[s, 1], Print[{n, ba[n]}]], {n, 2, 1000000}]

%t (* Second program: *)

%t Select[Range@ 2250, And[Length@ # > 1, Divisible[Total@ #, Last@ #]] &[FactorInteger[#][[All, 1]] ] &] (* _Michael De Vlieger_, Jul 18 2017 *)

%o (Haskell)

%o a071140 n = a071140_list !! (n-1)

%o a071140_list = filter (\x -> a008472 x `mod` a006530 x == 0) a024619_list

%o -- _Reinhard Zumkeller_, Apr 18 2013

%Y Cf. A008472, A006530, A000961, A025475, A037074, A071139-A071147.

%Y Subsequence of A024619.

%K nonn

%O 1,1

%A _Labos Elemer_, May 13 2002

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 10:55 EDT 2024. Contains 371241 sequences. (Running on oeis4.)