Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063968
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063968 sopf(n) = sopf(n+2), where sopf(n)= A008472(n). +0
1
2, 340, 845, 950, 1340, 3724, 5694, 6102, 7657, 8991, 9331, 9709, 10323, 11388, 11390, 12460, 15870, 18912, 19778, 20882, 21715, 24732, 26978, 29052, 29632, 32428, 33596, 35028, 38178, 42718, 43068, 45750, 46102, 50396, 53251, 61408 (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+2), 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; r=sopf(1); s=sopf(2); for (m=1, 10^9, t=sopf(m + 2); if(r==t, write("b063968.txt", n++, " ", m); if (n==1000, break)); r=s; s=t ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 04 2009]

CROSSREFS

Cf. A008472, A006145.

Sequence in context: A159488 A083863 A057626 this_sequence A064501 A063831 A064023

Adjacent sequences: A063965 A063966 A063967 this_sequence A063969 A063970 A063971

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research