|
Search: id:A095237
|
|
|
| A095237 |
|
a(1)=1; then for n even, a(n)=(sum of previous terms times n) plus 1, for n odd, a(n)=(sum of previous terms times n) minus 1. |
|
+0
1
|
|
| 1, 3, 11, 61, 379, 2731, 22301, 203897, 2064455, 22938391, 277554529, 3633441109, 51170962283, 771500662115, 12399117783989, 211611610180081, 3822234708877711, 72847296804492847, 1460993008134550985
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Conjecture: There are infinitely many primes in this sequence.
The sequence would have been a little nicer if the even terms had a minus one and the odd a plus one, so the first term would not have to be an exception.
|
|
PROGRAM
|
(PARI) a=vector(100) s=1 for(i=2, 100, if(Mod(i, 2)==0, a[i]=s*i+1, a[i]=s*i-1); s+=a[i])
|
|
CROSSREFS
|
Cf. A095236.
Sequence in context: A076475 A125556 A127516 this_sequence A024528 A004108 A069725
Adjacent sequences: A095234 A095235 A095236 this_sequence A095238 A095239 A095240
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 13 2004
|
|
EXTENSIONS
|
Edited by Johan Claes (Johan.Claes(AT)luc.ac.be), Jun 16 2004
|
|
|
Search completed in 0.002 seconds
|
