Search: id:A108939
Results 1-1 of 1 results found.

%I A108939
%S A108939 2,2,3,2,2,3,5,2,2,3,7,2,2,3,5,2,2,3,11,2,2,3,5,7,13,2,2,3,2,2,3,5,17,
%T A108939 2,2,3,7,19,2,2,3,5,11,2,2,3,23,2,2,3,5,7,13,2,2,3,2,2,3,5,29,2,2,
%U A108939 3,7,11,31,2,2,3,5,17,2,2,3,2,2,3,5,7,13,19,2,2,3,2,2,3,5,11,2,2
%N A108939 Triangle read by rows in which row n lists all primes p such that p-1|n.
%C A108939 Row 2n-1 contains only the term 2.
%e A108939 Row n = 1 : 2 because 1|1.
%e A108939 Row n = 2 : 2, 3 because 1|2 and 2|2.
%e A108939 Row n = 3 : 2 because 1|3.
%e A108939 Row n = 4 : 2, 3, 5 because 1|4, 2|4 and 4|4.
%e A108939 Row n = 5 : 2 because 1|5.
%e A108939 Row n = 6 : 2, 3, 7 because 1|6, 2|6 and 6|6.
%e A108939 Row n = 7 : 2 because 1|7.
%e A108939 Row n = 8 : 2, 3, 5 because 1|8, 2|8 and 4|8.
%e A108939 Row n = 9 : 2 because 1|9.
%e A108939 Row n = 10 : 2, 3, 11 because 1|10, 2|10 and 10|10.
%e A108939 Row n = 11 : 2 because 1|11.
%e A108939 Row n = 12 : 2, 3, 5, 7, 13 because 1|12, 2|12, 4|12, 6|12 = and 12|12.
%p A108939 with(numtheory): for n from 1 to 20 do div:=divisors(n): A:=[seq(div[j]+1,
               j=1..tau(n))]: B:={}: for i from 1 to tau(n) do if isprime(A[i])=true 
               then B:=B union {A[i]} else B:=B: fi: od: C:=convert(B,list): b[n]:=C: 
               od: for n from 1 to 20 do b[n]:=b[n] od; # yields sequence in triangular 
               form (Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 03 2005)
%Y A108939 Row products are A027760. Row sums are A085020. Cf. A067513, A108077.
%Y A108939 Sequence in context: A155940 A153095 A054483 this_sequence A138143 A106441 
               A131836
%Y A108939 Adjacent sequences: A108936 A108937 A108938 this_sequence A108940 A108941 
               A108942
%K A108939 easy,nonn
%O A108939 1,1
%A A108939 Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Jul 20 2005

Search completed in 0.001 seconds