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.

A123211 Terms in A006512 containing the digit "6" at least once, such that changing every "6" to a "9" and vice versa yields a larger term in A006512.

This page as a plain text file.
%I A123211 #18 Nov 19 2024 03:16:10
%S A123211 1063,3361,7561,10861,14563,16141,16693,26881,32611,36343,55633,61153,
%T A123211 62971,62983,64153,68713,70621,76963,100363,106453,115603,116101,
%U A123211 131641,136993,146521,152641,155863,160711,161341,161971,166741,167341,167863
%N A123211 Terms in A006512 containing the digit "6" at least once, such that changing every "6" to a "9" and vice versa yields a larger term in A006512.
%C A123211 1063 is in A006512 and so is 1093, obviously 1093 > 1063, therefore 1063 is in the sequence.
%C A123211 If the definition of the permitted terms included any term in A006512, instead of a larger term, the sequence would also contain 19963, 79693, 92671, 92683, and 139663. - _James C. McMahon_, Nov 17 2024
%t A123211 gtp=Select[Prime[Range[PrimePi[400000]]],PrimeQ[#-2]&];Select[gtp,MemberQ[IntegerDigits[#],6]&&MemberQ[gtp,r=FromDigits[IntegerDigits[#]/.{6->9,9->6}]]&&r>#&] (* _James C. McMahon_, Nov 17 2024 *)
%Y A123211 Cf. A006512.
%K A123211 base,nonn,less
%O A123211 1,1
%A A123211 _Pierre CAMI_, Oct 05 2006
%E A123211 Edited, corrected and extended by _Pierre CAMI_ and _Stefan Steinerberger_, Aug 14 2007