This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A152720 A prime-based vector recursion: a(n)={Prime[n],Prime[n-1],-Prime[n-2],...,-1,-1}. 0

%I

%S -1,1,-1,3,-1,-1,5,-3,-1,-1,7,-5,-3,-1,-1,11,-7,-5,-3,-1,-1,13,-11,-7,

%T -5,-3,-1,-1,17,-13,-11,-7,-5,-3,-1,-1,19,-17,-13,-11,-7,-5,-3,-1,-1,

%U 23,-19,-17,-13,-11,-7,-5,-3,-1,-1,29,-23,-19,-17,-13,-11,-7,-5,-3,-1,-1

%N A prime-based vector recursion: a(n)={Prime[n],Prime[n-1],-Prime[n-2],...,-1,-1}.

%C Row sums are: {-1, 0, 1, 0, -3, -6, -15, -24, -39, -54, -71,...}

%F a(n)={Prime[n],Prime[n-1],-Prime[n-2],...,-1,-1}.

%e {-1},

%e {1, -1},

%e {3, -1, -1},

%e {5, -3, -1, -1},

%e {7, -5, -3, -1, -1},

%e {11, -7, -5, -3, -1, -1},

%e {13, -11, -7, -5, -3, -1, -1},

%e {17, -13, -11, -7, -5, -3, -1, -1},

%e {19, -17, -13, -11, -7, -5, -3, -1, -1},

%e {23, -19, -17, -13, -11, -7, -5, -3, -1, -1},

%e {29, -23, -19, -17, -13, -11, -7, -5, -3, -1, -1}

%t b[0] = {-1}; b[1] = {1, -1};

%t b[n_] := b[n] = Join[{Prime[n ]}, {-b[n - 1][[ 1]]}, Table[b[n - 1][[i]], {i, 2, Length[b[n - 1]]}]];

%t Table[b[n], {n, 0, 10}]; Flatten[%]

%Y A152568

%K tabl,sign

%O 0,4

%A _Roger L. Bagula_, Dec 11 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 18 05:39 EDT 2019. Contains 328146 sequences. (Running on oeis4.)