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!)
A162922 Square array read by antidiagonals: m is the a(n,m)th positive integer among those which are coprime to n. Or a(n,m) = 0 if m and n are not coprime. 1

%I #10 Sep 05 2016 16:17:08

%S 1,1,2,1,0,3,1,2,2,4,1,0,0,0,5,1,2,2,3,3,6,1,0,3,0,4,0,7,1,2,0,4,3,0,

%T 4,8,1,0,3,0,0,0,5,0,9,1,2,2,4,2,5,4,6,5,10,1,0,0,0,5,0,6,0,0,0,11,1,

%U 2,2,3,3,6,3,7,5,7,6,12,1,0,3,0,4,0

%N Square array read by antidiagonals: m is the a(n,m)th positive integer among those which are coprime to n. Or a(n,m) = 0 if m and n are not coprime.

%H Robert Israel, <a href="/A162922/b162922.txt">Table of n, a(n) for n = 1..10000</a>

%e Rows 1 through 7 of the array:

%e n=1: 1,2,3,4,5,6,7,8,9,...

%e n=2: 1,0,2,0,3,0,4,0,5,...

%e n=3: 1,2,0,3,4,0,5,6,0,...

%e n=4: 1,0,2,0,3,0,4,0,5,...

%e n=5: 1,2,3,4,0,5,6,7,8,...

%e n=6: 1,0,0,0,2,0,3,0,0,...

%e n=7: 1,2,3,4,5,6,0,7,8,...

%p N:= 20: # for the first N antidiagonals

%p for n from 1 to N do

%p t:= 0:

%p for m from 1 to N+1-n do

%p if igcd(m,n)=1 then

%p t:= t+1; T[n,m]:= t;

%p else T[n,m]:= 0

%p fi

%p od

%p od:

%p [seq(seq(T[i-m,m],m=1..i-1),i=1..N+1)]; # _Robert Israel_, Sep 05 2016

%K nonn,tabl

%O 1,3

%A _Leroy Quet_, Jul 17 2009

%E More terms from _Robert Israel_, Sep 05 2016

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