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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A061917 Either a palindrome or becomes a palindrome if trailing 0's are omitted. 4
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 20, 22, 30, 33, 40, 44, 50, 55, 60, 66, 70, 77, 80, 88, 90, 99, 100, 101, 110, 111, 121, 131, 141, 151, 161, 171, 181, 191, 200, 202, 212, 220, 222, 232, 242, 252, 262, 272, 282, 292, 300, 303, 313, 323, 330, 333, 343, 353, 363, 373, 383, 393, 400, 404 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

FORMULA

A136522(A004151(a(n))) = 1. [Reinhard Zumkeller, Sep 25 2011]

PROG

(Haskell)

a061917 n = a061917_list !! (n-1)

a061917_list = filter chi [0..] where

   chi x = zs == reverse zs where

      zs = dropWhile (== '0') $ reverse $ show x

-- Reinhard Zumkeller, Sep 25 2011

CROSSREFS

Cf. A002113, A057890, A057891.

Sequence in context: A061362 A084050 A169824 * A125289 A180482 A096091

Adjacent sequences:  A061914 A061915 A061916 * A061918 A061919 A061920

KEYWORD

nonn,base,easy,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jun 27 2001

EXTENSIONS

Corrected by Ray Chandler, Jun 08 2009

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

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

Last modified February 14 23:53 EST 2012. Contains 205689 sequences.