Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063961
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063961 Numbers n such that z(n) = j(n), where z(n)=sopf(n-d(n)), j(n)=d(sopf(n)+n), sopf(n)=A008472 and d(n)= A000005. +0
1
6, 24, 40, 516, 532, 679, 1219, 1581, 1790, 2196, 2212, 3060, 3182, 4120, 4266, 5816, 9084, 9812, 11648, 11911, 13532, 16488, 16904, 17016, 17436, 20448, 20460, 21129, 23962, 25356, 26016, 34307, 34856, 41624, 42348, 44392, 48420, 50696 (list; graph; listen)
OFFSET

1,1

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,375

PROGRAM

(PARI) sumprime(n, s, fac, i) = fac=factor(n); for(i=1, matsize(fac)[1], s=s+fac[i, 1]); return(s); z(n)=sumprime(n-numdiv(n)); d(n)=numdiv(sumprime(n)+n); for(n=1, 10^6, if(d(n)==z(n), print(n)))

(PARI) sumprime(n)= { local(f, s=0); f=factor(n); for(i=1, matsize(f)[1], s+=f[i, 1]); return(s) } z(n)= { sumprime(n - numdiv(n)) } d(n)= { numdiv(sumprime(n) + n) } { n=0; for (m=1, 10^9, if(d(m)==z(m), write("b063961.txt", n++, " ", m); if (n==375, break)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 04 2009]

CROSSREFS

Sequence in context: A147826 A065743 A082195 this_sequence A112423 A062899 A061811

Adjacent sequences: A063958 A063959 A063960 this_sequence A063962 A063963 A063964

KEYWORD

nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Sep 04 2001

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