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!)
A097387 Let f(x)=(largest digit of x)^(smallest digit of x) + x (A097385). Sequence gives numbers n such that f(n) and f(n+1) are both prime. 2

%I #6 Dec 15 2017 17:36:46

%S 60,460,640,820,1360,1480,1620,1870,2110,2380,3460,3630,3880,4560,

%T 4650,5640,5650,5860,6210,6310,6360,6420,7480,8170,8680,8830,11680,

%U 11830,12280,12640,12820,13780,14620,15460,15640,15660,15880,16410,16420

%N Let f(x)=(largest digit of x)^(smallest digit of x) + x (A097385). Sequence gives numbers n such that f(n) and f(n+1) are both prime.

%C Conjecture: Terms will always be multiples of ten. Aug 21, 2004: _Dean Hickerson_ proved this.

%e 640 is in the sequence because 6^0 + 640 = 641 and 6^1 + 641 = 647, both prime.

%Y Cf. A054054, A054055, A097385, A097386.

%K base,easy,nonn

%O 1,1

%A _Jason Earls_, Aug 18 2004

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 19 03:30 EDT 2024. Contains 371782 sequences. (Running on oeis4.)