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!)
A140869 Triangle read by rows where T(m,n) = floor((2mn+m+n-2)/2), m >= n >= 1. 3

%I #22 Sep 08 2022 08:45:35

%S 1,2,5,4,7,11,5,10,14,19,7,12,18,23,29,8,15,21,28,34,41,10,17,25,32,

%T 40,47,55,11,20,28,37,45,54,62,71,13,22,32,41,51,60,70,79,89,14,25,35,

%U 46,56,67,77,88,98,109,16,27,39,50,62,73,85,96,108,119,131,17,30,42,55,67,80,92,105,117,130,142,155

%N Triangle read by rows where T(m,n) = floor((2mn+m+n-2)/2), m >= n >= 1.

%C Conjecture: If h does not belong to the sequence, then 4*h+5 is prime. - _Vincenzo Librandi_, Nov 18 2012

%C First column: A001651; second column: A047215; third column: A047345. - _Vincenzo Librandi_, Nov 18 2012

%H Vincenzo Librandi, <a href="/A140869/b140869.txt">Rows n = 1..100, flattened</a>

%e Triangle begins:

%e 1;

%e 2, 5;

%e 4, 7, 11;

%e 5, 10, 14, 19;

%e 7, 12, 18, 23, 29;

%e 8, 15, 21, 28, 34, 41;

%e 10, 17, 25, 32, 40, 47, 55; etc.

%t Flatten[Table[Floor[(2*n*m+m+n-2)/2],{n,1,10},{m,n}]] (* _Vladimir Joseph Stephan Orlovsky_, Feb 03 2012 *)

%o (Magma) [Floor(((2*n*k+n+k-2)/2)): k in [1..n], n in [1..11]]; // _Vincenzo Librandi_, Nov 18 2012

%Y Cf. A002327, A153085, A001651, A047215, A047345.

%K nonn,tabl,easy

%O 1,2

%A _Vincenzo Librandi_, Jan 16 2009

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 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)