Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A075565
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A075565 Numbers n such that sopf(n) = sopf(n-1) + sopf(n-2), where sopf(x) = sum of the distinct prime factors of x. +0
8
5, 23, 58, 901, 1552, 1921, 4195, 6280, 10858, 19649, 20385, 32017, 63657, 65704, 83272, 84120, 86242, 105571, 145238, 181845, 271329, 271742, 316711, 322954, 331977, 345186, 379660, 381431, 409916, 424504, 490256, 524477, 542566, 550272 (list; graph; listen)
OFFSET

1,1

EXAMPLE

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

MATHEMATICA

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

CROSSREFS

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

Sequence in context: A053664 A092544 A098499 this_sequence A075707 A126420 A116581

Adjacent sequences: A075562 A075563 A075564 this_sequence A075566 A075567 A075568

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 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research