Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076525
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076525 Numbers n such that sopf(n) = sopf(n+1) - sopf(n-1), where sopf(x) = sum of the distinct prime factors of x. +0
8
4, 22, 57, 900, 1551, 1920, 4194, 6279, 10857, 19648, 20384, 32016, 63656, 65703, 83271, 84119, 86241, 105570, 145237, 181844, 271328, 271741, 316710, 322953, 331976, 345185, 379659, 381430, 409915, 424503, 490255, 524476, 542565, 550271 (list; graph; listen)
OFFSET

1,1

EXAMPLE

The sum of the distinct prime factors of 22 is 2 + 11 = 13; the sum of the distinct prime factors of 23 is 23; the sum of the distinct prime factors of 21 is 3 + 7 = 10; and 13 = 23 - 10. Hence 22 belongs to the sequence.

MATHEMATICA

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

CROSSREFS

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

Sequence in context: A022603 A050773 A122241 this_sequence A089761 A098837 A104171

Adjacent sequences: A076522 A076523 A076524 this_sequence A076526 A076527 A076528

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research