OFFSET
1,5
EXAMPLE
a(4)=1 counts the progression (3,5,7) with all 3 members less than or equal to prime(4)=7.
a(5)=2 counts (3,5,7) and (3,7,11). a(7)=3 counts (3,5,7), (3,7,11) and (5,11,17).
Progressions with length larger than 3 are defined to contribute with each of their sublists: The progression (5,11,17,23) counts twice in a(9), as (5,11,17) and as (11,17,23).
MAPLE
A125505 := proc(n, verb) local r, p, a, q, strid; a := 0 ; p := 2 ; while p+4 <= ithprime(n) do for strid from 2 do q := p+strid ; r := q+strid ; if r > ithprime(n) then break ; fi ; if isprime(q) and isprime(r) then if verb then print(n, p, q, r) ; fi ; a := a+1 ; fi ; od: p := nextprime(p) ; od: RETURN(a) ; end: seq(A125505(n, false), n=1..80) ; # R. J. Mathar, Nov 21 2007
CROSSREFS
KEYWORD
nonn
AUTHOR
Giovanni Teofilatto, Jan 03 2007; definition corrected Jan 26 2007
EXTENSIONS
Corrected and extended by R. J. Mathar, Nov 21 2007
STATUS
approved