Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A075784
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A075784 Numbers n such that sopf(n) = sopf(n-1) + sopf(n-2) + sopf(n-3), where sopf(x) = sum of the distinct prime factors of x. +0
8
23156, 59785, 72521, 98426, 362231, 480223, 506123, 1049790, 1077252, 1133953, 1202068, 1277411, 1327229, 1627040, 2200058, 2317712, 2368026, 3610497, 4174012, 5668196, 6302128, 6324778, 6946075, 7179599, 7786163, 8053816 (list; graph; listen)
OFFSET

1,1

EXAMPLE

The sum of the distinct prime factors of 23156 is 2 + 7 + 827 = 836; the sum of the distinct prime factors of 23155 is 5 + 11 + 421 = 437; the sum of the distinct prime factors of 23154 is 2 + 3 + 17 + 227 = 249; the sum of the distinct prime factors of 23153 is 13 + 137 = 150; and 836 = 437 + 249 + 150. Hence 23156 belongs to the sequence.

MATHEMATICA

p[n_] := Apply[Plus, Transpose[FactorInteger[n]][[1]]]; Select[Range[5, 10^5], p[ # - 1] + p[ # - 2] + p[ # - 3] == p[ # ] &]

CROSSREFS

Cf. A008472, A075565, A075846, A076525, A076527, A076531, A076532, A076533.

Sequence in context: A116062 A104077 A087425 this_sequence A126301 A133968 A031847

Adjacent sequences: A075781 A075782 A075783 this_sequence A075785 A075786 A075787

KEYWORD

nonn

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Oct 18 2002

EXTENSIONS

Edited and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Feb 13 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research