Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063969
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063969 sopf(n) = sopf(n+3), where sopf(n)= A008472(n). +0
1
7, 60, 147, 407, 470, 1053, 1175, 3431, 3822, 5126, 5960, 6280, 6321, 6897, 7200, 8687, 9243, 10760, 12614, 15093, 16153, 18080, 18818, 19668, 20433, 20976, 24648, 26826, 30804, 44016, 45878, 46221, 47423, 55965, 58506, 58682, 59645, 63897 (list; graph; listen)
OFFSET

1,1

LINKS

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

PROGRAM

(PARI) sopf(n, s, fac, i)=fac=factor(n); for(i=1, matsize(fac)[1], s=s+fac[i, 1]); return(s); j=[]; for(n=1, 100000, if(sopf(n)==sopf(n+3), j=concat(j, n))); j

(PARI) sopf(n)= { local(f, s=0); f=factor(n); for(i=1, matsize(f)[1], s+=f[i, 1]); return(s) } { n=0; for (m=1, 10^9, if(sopf(m)==sopf(m + 3), write("b063969.txt", n++, " ", m); if (n==1000, break)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 04 2009]

CROSSREFS

Cf. A008472, A006145.

Sequence in context: A135150 A077409 A099347 this_sequence A015570 A024090 A156545

Adjacent sequences: A063966 A063967 A063968 this_sequence A063970 A063971 A063972

KEYWORD

nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Sep 05 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 December 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research