This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
A002808 := proc(n) option remember ; local a ; if n = 1 then 4; else for a from A002808(n-1)+1 do if not isprime(a) then RETURN(a) ; fi ; od: fi ; end: isA060254 := proc(n) local i,sComp ; if isprime(n) then for i from 1 do sComp := A002808(i)+A002808(i+1) ; if sComp = n then RETURN(i); elif sComp > n then RETURN(-1) ; fi ; od: else -1 ; fi ; end: A046665 := proc(n) local a,ifs ; a := 0 ; ifs := seq(op(1, i),i=ifactors(n)[2]) ; max(ifs)-min(ifs) ; end: A111426 := proc(n) A046665(A002808(n)) ; end: isA135170 := proc(p) local i ; i := isA060254(p) ; if i > 0 then A111426(i) + A111426(i+1) ; isprime(%) ; else false ; fi ; end: for n from 1 to 300 do p := ithprime(n) ; if isA135170(p) then printf("%d,",p) ; fi ; od: # R. J. Mathar, Feb 19 2008
composite(1) = 4; (smallest prime factor of 4) = (largest prime factor of 4) = 2. composite(2) = 6, (largest prime factor of 6) = 3. Hence a(1) = 3. composite(5) = 10; (smallest prime factor of 10) = 2, (largest prime factor of 10) = 5. composite(2) to composite(5) are 6, 8, 9, 10, largest prime factors are 3, 2, 3, 5. Hence a(5) = 3+2+3+5 = 13. composite(7) = 14; (smallest prime factor of 14) = 2, (largest prime factor of 14) = 7. composite(2) to composite(7) are 6, 8, 9, 10, 12, 14, largest prime factors are 3, 2, 3, 5, 3, 7. Hence a(5) = 3+2+3+5+3+7 = 23.
Composites:=[ j: j in [4..100] | not IsPrime(j) ]; [ &+[ E[ #E] where E is PrimeDivisors(Composites[k]): k in [D[1]..D[ #D]] where D is PrimeDivisors(Composites[n]) ]: n in [1..73] ]; // Klaus Brockhaus, Jun 25 2009
Comments