The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A229944 Triangle read by rows in which T(2n-2,k) = n/k if k divides n and n/k > sqrt(n), otherwise 0, for n >= 2. Also T(2n-1,k) = k if k divides n, otherwise 0, for n >= 1. Row lengths are the same row lengths of A229940. 1

%I

%S 1,2,1,3,1,4,1,2,5,0,1,0,6,3,1,2,7,0,1,0,8,4,1,2,9,0,1,0,3,10,5,0,1,2,

%T 0,11,0,0,1,0,0,12,6,4,1,2,3,13,0,0,1,0,0,14,7,0,1,2,0,15,0,5,1,0,3,

%U 16,8,0,1,2,0,4,17,0,0,0,1,0,0,0,18,9,6,0,1,2,3,0

%N Triangle read by rows in which T(2n-2,k) = n/k if k divides n and n/k > sqrt(n), otherwise 0, for n >= 2. Also T(2n-1,k) = k if k divides n, otherwise 0, for n >= 1. Row lengths are the same row lengths of A229940.

%C The positive terms are also the divisors associated with the exposed endpoints of the toothpick structure of A229950 which is related to A000005. Note that the exposed toothpick endpoints are equivalent to the vertices of the graph mentioned in A229940. See link section.

%H Omar E. Pol, <a href="http://www.polprimos.com/imagenespub/poldiv13.jpg">Illustration of initial terms of the divisor function (A000005)</a>, see the third picture.

%p Triangle begins:

%p 1;

%p 2;

%p 1;

%p 3;

%p 1;

%p 4;

%p 1, 2;

%p 5, 0;

%p 1, 0;

%p 6, 3;

%p 1, 2;

%p 7, 0;

%p 1, 0;

%p 8, 4;

%p 1, 2;

%p 9, 0;

%p 1, 0, 3;

%p 10, 5, 0;

%p 1, 2, 0;

%p 11, 0, 0;

%p 1, 0, 0;

%p 12, 6, 4;

%p 1, 2, 3;

%p 13, 0, 0;

%p 1, 0, 0;

%p 14, 7, 0;

%p 1, 2, 0;

%p 15, 0, 5;

%p 1, 0, 3;

%p 16, 8, 0;

%p 1, 2, 0, 4;

%p ...

%Y Cf. A000005, A000203, A229940, A229942, A229950, A229951.

%K nonn,tabf

%O 1,2

%A _Omar E. Pol_, Oct 05 2013

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 February 27 03:50 EST 2020. Contains 332299 sequences. (Running on oeis4.)