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.

A241895 Primes p equal to the sum in base 3 of the digits of all primes <= p.

This page as a plain text file.
%I A241895 #14 May 12 2014 11:49:46
%S A241895 3,37,695663,695881,1308731,1308757,1313153,1314301,1326097,1766227,
%T A241895 3204779,14328191
%N A241895 Primes p equal to the sum in base 3 of the digits of all primes <= p.
%F A241895 prime(n) such that, using base 3, prime(n) = sum_{1..n} A239619(i).
%e A241895 3 = digit-sum(primes <= 3,base=3) = sum(2) + sum(1,0). 37 = digit-sum(primes <= 37,base=3) = sum(2) + sum(1,0) + sum(1,2) + sum(2,1) + sum(1,0,2) + sum(1,1,1) + sum(1,2,2) + sum(2,0,1) + sum(2,1,2) + sum(1,0,0,2) + sum(1,0,1,1) + sum(1,1,0,1).
%o A241895 (PARI) sdt(n) = my(d = digits(n, 3)); sum(i=1, #d, d[i]);
%o A241895 lista(nn) = {sp = 0; forprime(p=1, nn, sp += sdt(p); if (p == sp, print1(p, ", ")););} \\ _Michel Marcus_, May 02 2014
%Y A241895 Cf. A168161 (similar in base 2), A240886 (similar but excluding p from the sum).
%K A241895 nonn,more,base
%O A241895 1,1
%A A241895 _Anthony Sand_, May 01 2014