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.

A361820 Palindromes in A329150.

This page as a plain text file.
%I A361820 #26 Apr 06 2023 06:36:27
%S A361820 0,2,3,5,7,11,22,33,55,77,202,222,232,252,272,303,313,323,333,353,373,
%T A361820 505,525,535,555,575,707,717,727,737,757,777,1111,2002,2112,2222,2332,
%U A361820 2552,2772,3003,3113,3223,3333,3553,3773,5005,5115,5225,5335,5555,5775,7007,7117
%N A361820 Palindromes in A329150.
%C A361820 If m is a palindrome with no digit greater than 5 in A118597, then A329147(m) is a term, but there exist terms that are not of this form as 313, 717, ...
%e A361820 232 is a term which has two preimages since A329147(91) = A329147(121) = 232.
%e A361820 313 = A329147(26) is a term whose preimage is not in A118597.
%e A361820 2002 is a term since A329147(1001) = 2002.
%e A361820 2112 is a term since A329147(151) = 2112.
%e A361820 27172 = A329147(1471) is a term whose preimage is not in A118597.
%t A361820 p[n_] := If[n > 0, Prime[n], 0]; seq[ndigmax_] := Module[{t = Table[FromDigits[ Flatten@ IntegerDigits@ (p /@ IntegerDigits[n])], {n, 0, 10^ndigmax - 1}]}, Union@ Select[t, # < 10^ndigmax && PalindromeQ[#] &]]; seq[4] (* _Amiram Eldar_, Mar 26 2023 *)
%o A361820 (PARI) ispal(n) = my(d=digits(n)); d==Vecrev(d);
%o A361820 f(n) = if (n, fromdigits(concat(apply(d -> if (d, digits(prime(d)), [0]), digits(n)))), 0); \\ A329147
%o A361820 lista(nn) = my(list = List(), m); for (n=0, nn, m = f(n); if ((m <= nn) && ispal(m), listput(list, m));); vecsort(Set(list)); \\ _Michel Marcus_, Mar 26 2023
%Y A361820 Intersection of A002113 and A329150.
%Y A361820 Cf. A118597, A329147, A361750, A361821.
%Y A361820 Subsequences: A002276, A002277, A002279, A002281, A099814.
%K A361820 nonn,base
%O A361820 1,2
%A A361820 _Bernard Schott_, Mar 25 2023