login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A105156 The sum of a triangular array made from a negative 6-fold permutation product. 0

%I #19 Nov 01 2021 12:16:47

%S 10,15,20,119,308,533,986,1463,2300,3741,4960,7289,9758,12083,15416,

%T 20193,25960,30561,38056,45369,51976,62489,72542,85707,102820,117261,

%U 130192,146697,161320,180009,218440,242481,272356,295653,339124,366477

%N The sum of a triangular array made from a negative 6-fold permutation product.

%e Triangle begins:

%e 10;

%e 6, 9;

%e -4, -6, -10;

%e -14, -21, -35, -49;

%e 22, 33, 55, 77, 121;

%e 26, 39, 65, 91, 143, 169;

%e ...

%t a[n_] := -Prime[n] /; 10 - Mod[Prime[n], 10] == 1;

%t a[n_] := -Prime[n] /; 10 - Mod[Prime[n], 10] == 3;

%t a[n_] := Prime[ n] /; (10 - Mod[Prime[n], 10] == 7) || (10 - Mod[Prime[n], 10] == 9);

%t a[1] = 5; a[3] = -2;

%t digits = 200

%t aa = Table[Abs[Apply[Plus, Table[Prime[n]*a[m], {n, 1.m}]]], {m, 1, digits}]

%Y Cf. A105155.

%K nonn,uned

%O 1,1

%A _Roger L. Bagula_, Apr 10 2005

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 07:41 EDT 2024. Contains 371964 sequences. (Running on oeis4.)