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.

A126802 Numbers n =d1+10d2+100d3+...+10^p dp such that "prime(1)*d1+prime(2)*d2+...+prime(p)*dp" is prime.

This page as a plain text file.
%I A126802 #7 May 07 2020 16:03:07
%S A126802 1,10,11,12,14,15,17,18,31,32,34,35,37,51,52,54,57,58,71,74,75,78,91,
%T A126802 92,95,97,98,100,101,103,104,106,107,109,120,121,123,124,126,129,140,
%U A126802 141,143,146,147,160,163,164,167,169,180,181,184,186,187,189,210,212,213
%N A126802 Numbers n =d1+10d2+100d3+...+10^p dp such that "prime(1)*d1+prime(2)*d2+...+prime(p)*dp" is prime.
%C A126802 Numbers n such that A263042(n) is prime. - _Robert Israel_, May 07 2020
%H A126802 Robert Israel, <a href="/A126802/b126802.txt">Table of n, a(n) for n = 1..10000</a>
%F A126802 For example 387 gives 7*2+8*3+3*5=53, a prime.
%p A126802 filter:= proc(n) local L,i;
%p A126802    L:= convert(n,base,10);
%p A126802    isprime(add(L[i]*P[i],i=1..nops(L)));
%p A126802 end proc:
%p A126802 select(filter, [$1..100]); # _Robert Israel_, May 07 2020
%Y A126802 Cf A263042. Includes A011557.
%K A126802 nonn,base
%O A126802 1,2
%A A126802 _Yalcin Aktar_, Feb 21 2007