cp's OEIS Frontend

A286369 Compound filter: a(n) = 2*A286364(n) + floor(A072400(n)/4).

%I A286369 #11 May 09 2017 17:36:35
%S A286369 2,2,4,2,7,5,5,2,14,6,4,4,7,5,11,2,6,14,4,7,33,5,5,5,20,6,58,5,7,11,5,
%T A286369 2,32,6,10,14,7,5,11,6,6,32,4,4,25,5,5,4,14,20,10,7,7,59,11,5,32,6,4,
%U A286369 11,7,5,135,2,42,32,4,6,33,11,5,14,6,6,28,4,33,11,5,7,242,6,4,33,43,5,11,5,6,24,10,5,33,5,11,5,6,14,134,20,7,11,5,6,46,6
%N A286369 Compound filter: a(n) = 2*A286364(n) + floor(A072400(n)/4).
%C A286369 This sequence contains, in addition to the information contained in A286364 (which packs the values of A286361(n) and A286363(n) to a single value with the pairing function A000027) also the bit-2 of A072400(n) (its third least significant bit), which is here stored as the least significant bit of a(n). In contrast to A286366, the parity of the highest power of 2 dividing n is not stored.
%C A286369 Thus we have (among other such identities) the following two identities related to equivalence class partitioning:
%C A286369 For all odd i, odd j: a(i) = a(j) <=> A286366(i) = A286366(j).
%C A286369 For all odd i, odd j: a(i) = a(j) => A010877(i) = A010877(j). [On odd numbers the information contained in a(n) is sufficient to determine the value of n modulo 8, one of the 1, 3, 5 or 7.]
%H A286369 Antti Karttunen, <a href="/A286369/b286369.txt">Table of n, a(n) for n = 1..10000</a>
%F A286369 a(n) = 2*A286364(n) + floor(A072400(n)/4).
%o A286369 (Scheme) (define (A286369 n) (+ (* 2 (A286364 n)) (floor->exact (/ (A072400 n) 4))))
%o A286369 (Python)
%o A286369 from sympy.ntheory.factor_ import digits
%o A286369 from sympy import factorint
%o A286369 from operator import mul
%o A286369 def P(n):
%o A286369     f = factorint(n)
%o A286369     return sorted([f[i] for i in f])
%o A286369 def a046523(n):
%o A286369     x=1
%o A286369     while True:
%o A286369         if P(n) == P(x): return x
%o A286369         else: x+=1
%o A286369 def A(n, k):
%o A286369     f = factorint(n)
%o A286369     return 1 if n == 1 else reduce(mul, [1 if i%4==k else i**f[i] for i in f])
%o A286369 def T(n, m): return ((n + m)**2 - n - 3*m + 2)/2
%o A286369 def a286364(n): return T(a046523(n/A(n, 1)), a046523(n/A(n, 3)))
%o A286369 def a072400(n): return int(str(int(''.join(map(str, digits(n, 4)[1:]))[::-1]))[::-1], 4)%8
%o A286369 def a(n): return 2*a286364(n) + int(a072400(n)/4) # _Indranil Ghosh_, May 09 2017
%Y A286369 Cf. A072400, A286364, A286366, A286370, A286371.
%K A286369 nonn
%O A286369 1,1
%A A286369 _Antti Karttunen_, May 09 2017