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!)
A081941 a(1) = 1; for n>1, a(n)= smallest number greater than the previous term such that a(n-1)*a(n) + 1 is a palindrome. 1

%I #7 Dec 05 2013 19:56:03

%S 1,2,3,7,14,23,32,45,153,167,352,3610,4977,11332,27866,46955,275824,

%T 508960,1978100,5211763,22579170,50936903,98746668,103408400,

%U 105030502,106085805,115059404,458335581,2483842510,4847757902,6623606611

%N a(1) = 1; for n>1, a(n)= smallest number greater than the previous term such that a(n-1)*a(n) + 1 is a palindrome.

%e 3 is followed by 7 because 3*4+1, 3*5+1 and 3*6+1 aren't palindromes, but 3*7+1 = 22 is.

%Y Cf. A082270.

%K base,nonn

%O 1,2

%A _Amarnath Murthy_, Apr 02 2003

%E More terms from _David Wasserman_, Jul 16 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 July 23 15:14 EDT 2024. Contains 374551 sequences. (Running on oeis4.)