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.

A124667 Prime numbers p such that the sum of the digits of p equals the sums of the digits of p^3.

This page as a plain text file.
%I A124667 #9 Sep 08 2023 22:51:37
%S A124667 487,577,4877,5851,15877,467587,496187,697967,5889959,8194787,
%T A124667 14596991,17978887,27698887,47959487,58590487,58678903,59489371,
%U A124667 79492771,79897897,79932871,109148887,109696969,145969757,227799577,276857947
%N A124667 Prime numbers p such that the sum of the digits of p equals the sums of the digits of p^3.
%e A124667 487^3 = 115501303 -- the sum of the digits of 487 and 115501303 is the same and is equal to 19.
%t A124667 Select[Range[10000000], PrimeQ[ # ] && Plus @@ IntegerDigits[ # ] == Plus @@ IntegerDigits[ #^3] &]
%t A124667 Select[Prime[Range[151*10^5]],Total[IntegerDigits[#]]==Total[ IntegerDigits[ #^3]]&] (* _Harvey P. Dale_, Feb 17 2018 *)
%Y A124667 An equivalent sequence for squares is A058370 = Primes p such that p and p^2 have same digit sum. This sequence is prime subsequence of A070276 = Sum of digits of n equals the sum of digits of n^3.
%K A124667 base,nonn
%O A124667 1,1
%A A124667 _Tanya Khovanova_, Dec 23 2006
%E A124667 More terms from _Olaf Voß_, Feb 11 2008