login
This site is supported by donations to The OEIS Foundation.

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006072 Numbers with mirror symmetry about middle.
(Formerly M4481)
9

%I M4481

%S 0,1,8,11,88,101,111,181,808,818,888,1001,1111,1881,8008,8118,8888,

%T 10001,10101,10801,11011,11111,11811,18081,18181,18881,80008,80108,

%U 80808,81018,81118,81818,88088,88188,88888,100001,101101,108801,110011

%N Numbers with mirror symmetry about middle.

%C Apparently this sequence and A111065 have the same parity. - Jeremy Gardiner, Oct 15 2005

%C Obviously, terms of this sequence also have the same parity (and also digital sum mod 6) as those of A118594, see below. - _M. F. Hasler_, May 08 2013

%C The number of n-digit terms is given by A225367 -- which counts palindromes in base 3, A118594. The terms here are the base 3 palindromes considered there, with 2 replaced by 8 (which means this sequence A006072 arises from A118594 not only by taking the 3rd power of each digit, but also by superposing the number with its horizotal or vertical reflection, somehow remarkably given the symmetry of numbers considered here). - _M. F. Hasler_, May 05 2013 [Part of the comment moved from A225367 to here on May 08 2013]

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/TetradicNumber.html">Tetradic Number</a>

%F a(n) = digit-wise application of A000578 to A118594(n). - _M. F. Hasler_, May 08 2013

%t NextPalindrome[n_] := Block[{l = Floor[Log[10, n] + 1], idn = IntegerDigits[n]}, If[ Union[idn] == {9}, Return[n + 2], If[l < 2, Return[n + 1], If[ FromDigits[ Reverse[ Take[idn, Ceiling[l/2]]]] > FromDigits[ Take[idn, -Ceiling[l/2]]], FromDigits[ Join[ Take[idn, Ceiling[l/2]], Reverse[ Take[idn, Floor[l/2]]]]], idfhn = FromDigits[ Take[idn, Ceiling[l/2]]] + 1; idp = FromDigits[ Join[ IntegerDigits[ idfhn], Drop[ Reverse[ IntegerDigits[ idfhn]], Mod[l, 2]]]]]]]]; np = 0; t = {0}; Do[np = NextPalindrome[np]; If[Union[Join[{0, 1, 8}, IntegerDigits[np]]] == {0, 1, 8}, AppendTo[t, np]], {n, 1150}]; t (* _Robert G. Wilson v_ *)

%o (PARI) {for(l=1,5,u=vector((l+1)\2,i,10^(i-1)+(2*i-1<l)*10^(l-i))~;forvec(v=vector((l+1)\2,i,[l>1&&i==1,2]), print1((v+v\2*6)*u",")))} \\ The n-th term could be produced by using (partial sums of) A225367 to skip all shorter terms, and then skipping the adequate number of vectors v until n is reached. - _M. F. Hasler_, May 05 2013

%Y Subsequence of A000787.

%K base,nonn,easy

%O 1,3

%A _N. J. A. Sloane_.

%E More terms from _Robert G. Wilson v_, Nov 16 2005

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

Content is available under The OEIS End-User License Agreement .

Last modified July 31 17:29 EDT 2014. Contains 245085 sequences.