login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A116054 n times pi(n) is a palindrome, where pi(n) = PrimePi(n) = A000720(n). 1

%I #9 Jul 25 2018 15:07:56

%S 1,2,3,4,11,28,33,37,44,53,132,138,279,378,458,474,482,504,674,1628,

%T 1696,2002,2332,3117,4183,5518,6341,6623,7094,19261,25971,28402,28831,

%U 33827,39119,51387,65621,85997,87843,174944,178926,212212,258357

%N n times pi(n) is a palindrome, where pi(n) = PrimePi(n) = A000720(n).

%H Chai Wah Wu, <a href="/A116054/b116054.txt">Table of n, a(n) for n = 1..100</a>

%e 85997 * p(85997) = 719020917.

%t ntpQ[n_]:=Module[{idn=IntegerDigits[n*PrimePi[n]]},idn==Reverse[idn]]; Select[Range[300000],ntpQ] (* _Harvey P. Dale_, Nov 13 2013 *)

%o (Python)

%o from sympy import nextprime

%o n, k, m, A116054_list = 0, 1, 2, []

%o while len(A116054_list) < 100:

%o for i in range(k,m):

%o s = str(i*n)

%o if s == s[::-1]:

%o A116054_list.append(i)

%o n += 1

%o k, m = m, nextprime(m) # _Chai Wah Wu_, Jul 25 2018

%Y Cf. A000720, A116053.

%K nonn,base

%O 1,2

%A _Giovanni Resta_, Feb 13 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 17 23:23 EDT 2024. Contains 371767 sequences. (Running on oeis4.)