References to A196736

Define k(x) = number of m such that A000005(gcd(n,m)) is x where m runs from 1 to n , x = 1,2,.. ; z = A000005( cototient(n) ) ; sequence gives numbers n such that n - ( Sum_{i=1..j} k(i) ) divides cototient(n) for any j <= z , k(i)>0.
1, 2, 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 17, 19, 23, 25, 27, 29, 31, 32, 33, 35, 37, 41


2 seqfan posts

Fri Oct 14 02:39:29 CEST 2011    [seqfan] Re: cototient divisibility in A196736
Thu Oct 13 16:01:21 CEST 2011    [seqfan] cototient divisibility in A196736

Index of A-numbers in seqfan: by ascending order    by month    by frequency    by keyword
Links to OEIS content are included according to The OEIS End-User License Agreement .