Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A075846
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A075846 Numbers n such that sopf(n) = 1/2 (sopf(n+1) + sopf(n-1)), where sopf(x) = sum of the distinct prime factors of x. +0
8
10, 21, 35, 82, 221, 296, 961, 2665, 12629, 13117, 30317, 54485, 99145, 125750, 132728, 142198, 156379, 185461, 225898, 241057, 265227, 265643, 280918, 281396, 284531, 326698, 379331, 393335, 400685, 437241, 437999, 548101, 584502, 641561 (list; graph; listen)
OFFSET

1,1

EXAMPLE

The sum of the distinct prime factors of 21 is 3 + 7 = 10; the sum of the distinct prime factors of 22 is 2 + 11 = 13; the sum of the distinct prime factors of 20 is 2 + 5 = 7; and 10 = 1/2 (13 + 7). Hence 21 belongs to the sequence.

MATHEMATICA

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

CROSSREFS

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

Sequence in context: A072806 A051942 A082581 this_sequence A164714 A060852 A089584

Adjacent sequences: A075843 A075844 A075845 this_sequence A075847 A075848 A075849

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 November 23 10:40 EST 2009. Contains 167421 sequences.


AT&T Labs Research