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!)
A060874 Intrinsic 4-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base. 8

%I #19 May 24 2016 02:44:08

%S 9,15,28,40,52,56,65,68,80,85,105,125,126,130,150,156,170,186,190,195,

%T 215,216,217,235,246,252,255,259,282,301,312,342,343,344,372,378,385,

%U 400,408,427,434,438,456,468,476,498,504,512,513,518,534

%N Intrinsic 4-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.

%C All numbers are intrinsic 1- and 2-palindromes, almost all numbers are intrinsic 3-palindromes and very few numbers are intrinsic k-palindromes for k >= 4.

%H Robert Israel and Peter Kagey, <a href="/A060874/b060874.txt">Table of n, a(n) for n = 1..10000</a> (1..1000 from Peter Kagey)

%H A. J. Di Scala and M. Sombra, <a href="http://arXiv.org/abs/math.GM/0105022">Intrinsic Palindromic Numbers</a>, arXiv:math/0105022 [math.GM], 2001.

%H A. J. Di Scala and M. Sombra, <a href="http://www.fq.math.ca/Papers1/42-1/quartscala01_2004.pdf">Intrinsic Palindromes</a>, Fib. Quart. 42, no. 1, Feb. 2004, pp. 76-81.

%p N:= 10^4: # to get all terms <= N

%p S:= {}:

%p for b from 2 to floor(N^(1/3)) do

%p S:= S union {seq(seq((b^3+1)*i+(b^2+b)*j,j=0..b-1),i=1..b-1)}

%p od:

%p sort(convert(select(`<=`,S,N),list)); # _Robert Israel_, May 23 2016

%Y Cf. A060873-A060879, A060947-A060949.

%K nonn,base

%O 1,1

%A _Harvey P. Dale_, May 05 2001

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 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)