The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A036923 Odd composite numbers n such that the digit sum of n equals digit sum of sum of its prime factors (counted with multiplicity). 0
 27, 105, 121, 265, 315, 355, 445, 517, 841, 913, 915, 1111, 1165, 1185, 1219, 1221, 1239, 1255, 1345, 1363, 1507, 1633, 1903, 2067, 2101, 2155, 2173, 2209, 2227, 2245, 2265, 2335, 2409, 2515, 2533, 2605, 2965, 3091, 3129, 3219, 3235, 3417, 3505, 3507 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS MATHEMATICA ds[n_]:=Total[IntegerDigits[n]]; t={}; Do[If[!PrimeQ[n]&&ds[n]==ds[Total[ Times@@@FactorInteger[n]]], AppendTo[t, n]], {n, 9, 3508, 2}]; t (* Jayanta Basu, Jun 04 2013 *) CROSSREFS Cf. A006753, A036920, A019506. Sequence in context: A031429 A154377 A232283 * A036346 A140376 A046347 Adjacent sequences:  A036920 A036921 A036922 * A036924 A036925 A036926 KEYWORD nonn,base AUTHOR Patrick De Geest, Jan 04 1999 EXTENSIONS Title reworded by Sean A. Irvine, Nov 30 2020 STATUS approved

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.

Last modified June 13 11:31 EDT 2021. Contains 344990 sequences. (Running on oeis4.)