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!)
A074302 Sum of squares of digits of n is equal to the largest prime factor of n. 0

%I #7 Dec 15 2017 17:36:01

%S 1,120,133,267,298,803,917,973,1200,1316,1330,1606,2023,2511,2575,

%T 2669,2670,2980,3312,6179,6328,8030,8083,8362,9170,9730,10686,11256,

%U 12000,12312,12862,12927,12954,13160,13300,14271,14514,14615,14873,15272

%N Sum of squares of digits of n is equal to the largest prime factor of n.

%e 298 = 2.'149' and 2^2 + 9^2 + 8^2 = 149.

%t Select[Range[16000],FactorInteger[#][[-1,1]]==Total[IntegerDigits[#]^2]&] (* _Harvey P. Dale_, Sep 20 2013 *)

%K base,nonn

%O 0,2

%A _Jason Earls_, Sep 21 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 May 10 04:35 EDT 2024. Contains 372356 sequences. (Running on oeis4.)