|
Search: id:A133394
|
|
| |
|
| 0, 2, 0, 2, 5, 2, 7, 2, 9, 7, 11, 14, 13, 23, 20, 34, 34, 47, 57, 67, 91, 101, 138, 158, 205, 249, 306, 387, 464, 592, 713, 898, 1100, 1362, 1692, 2075, 2590, 3175, 3952, 4867, 6027, 7457, 9202, 11409, 14069, 17436, 21526, 26638, 32935, 40707, 50371, 62233
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Perrin-like prime-divisibility sequence, but based upon template 7=5+2 in place of 5=3+2.
1. Apparently identical to A007387 but for latter's third term 3. 2. Attention directed to remainder upon division of a term by its (composite) argument, when latter =1 or 5 (mod 6). Possible factorization tool for impostor candidate primes? 3. Recurrence period, any length-five string of term values (mod 6) found in the sequence: 2^3*13*31, to Perrin's three-term period of 7*13. Note 13= 2*6+1, 31 = 5*6+1. 4. Query: Smallest pseudoprime >9. 5. Query: Closed form for nth term.
Semiprimes a= 9, 14, 34, 57, 91 etc. are at the indices n=9, 12, 16, 17, 19, 21, 24, 25, 26, 31, 32, 40, 44, 45, 51, 53, 59, 66, 72, 76, 80, 110 etc. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 24 2007
|
|
FORMULA
|
O.g.f.: -x*(2+5*x^3)/(-1+x^2+x^5). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 24 2007
Rewritten, Mathar's o.g.f. resembles a logarithmic derivative: -(5*x^4 + 2*x) / (x^5 +x^2-1). Any significance? - G. Reed Jameson (Reedjameson(AT)yahoo.com), Dec 13 2007, Dec 16 2007
|
|
PROGRAM
|
(PARI) {a(n) = if( n<1, 0, n++; polsym(x^5 - x^3 - 1, n)[n])} /* Michael Somos Jan 11 2008 */
|
|
CROSSREFS
|
Cf. A007387, A001608, A135435.
Sequence in context: A052438 A005074 A078182 this_sequence A094721 A011297 A110282
Adjacent sequences: A133391 A133392 A133393 this_sequence A133395 A133396 A133397
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
G. Reed Jameson (Reedjameson(AT)yahoo.com), Nov 23 2007
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 24 2007
|
|
|
Search completed in 0.002 seconds
|
