cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A179937 a(n) is the product of the non-palindromic divisors of n.

This page as a plain text file.
%I A179937 #23 May 15 2023 18:14:24
%S A179937 1,1,1,1,1,1,1,1,1,10,1,12,13,14,15,16,17,18,19,200,21,1,23,288,25,
%T A179937 338,27,392,29,4500,31,512,1,578,35,7776,37,722,507,8000,41,12348,43,
%U A179937 1,675,1058,47,221184,49,12500,867,17576,53,26244,1,21952,1083,1682,59
%N A179937 a(n) is the product of the non-palindromic divisors of n.
%H A179937 Indranil Ghosh, <a href="/A179937/b179937.txt">Table of n, a(n) for n = 1..10000</a>
%F A179937 a(n) = A007955(n) / A184392(n).
%e A179937 For n = 20, set of non-palindromic divisors is {10, 20}; a(12) = 10*20 = 200.
%t A179937 Table[Times@@Select[Divisors[n],!PalindromeQ[#]&],{n,60}] (* _Harvey P. Dale_, May 15 2023 *)
%o A179937 (Python)
%o A179937 def ispal(n):
%o A179937     return n==int(str(n)[::-1])
%o A179937 def A179937(n):
%o A179937     s=1
%o A179937     for i in range(1, n+1):
%o A179937         if n%i==0 and not ispal(i):
%o A179937             s*=i
%o A179937     return s # _Indranil Ghosh_, Feb 10 2017
%Y A179937 Cf. A087990, A087991, A088000, A088001, A184392.
%K A179937 nonn,base
%O A179937 1,10
%A A179937 _Jaroslav Krizek_, Jan 12 2011
%E A179937 More terms from _Indranil Ghosh_, Feb 10 2017