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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109733 Sequence is its own base-10 ASCII representation. 2
53, 51, 53, 49, 53, 51, 52, 57, 53, 51, 53, 49, 53, 50, 53, 55, 53, 51, 53, 49, 53, 51, 52, 57, 53, 51, 53, 48, 53, 51, 53, 53, 53, 51, 53, 49, 53, 51, 52, 57, 53, 51, 53, 49, 53, 50, 53, 55, 53, 51, 53, 49, 53, 51, 52, 56, 53, 51, 53, 49, 53, 51, 53, 51, 53, 51, 53, 49, 53 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Out of the digits 0,1,...,9, 5 is the only one whose ASCII representation, converted to base 10, begins with itself. So this sequence is the unique one with this property. - N. J. A. Sloane, Aug 25 2015

The octal version of this idea is simply 66,66,66,66,.., not interesting.

LINKS

Table of n, a(n) for n=1..69.

FORMULA

I conjecture that a(n) = 53 when n is congruent to 1, 3 or 5 (mod 8) and a(n) = 51 when n is congruent to 2 (mod 8). - Jonathan Cross (jcross(AT)juggler.net), Oct 14 2005

EXAMPLE

We use the following table, giving digit d, ASCII equivalent in base 8, ASCII equivalent in base 10:

.0..1..2..3..4..5..6..7..8..9

60 61 62 63 64 65 66 67 70 71

48 49 50 51 52 53 54 55 56 57

We must start with 5 (see comment above), so the sequence grows like this:

5

53

53 51

53 51 53 49

53 51 53 49 53 51 52 57

...

PROG

(PARI) a(n) = (valuation(1+n>>n=valuation(n, 2), 2)%5!=3)+56-(n-3)%5*2  \\ - M. F. Hasler, Jun 20 2011

CROSSREFS

See A109648 for another version.

Sequence in context: A259091 A104936 A109648 * A094462 A232125 A042403

Adjacent sequences:  A109730 A109731 A109732 * A109734 A109735 A109736

KEYWORD

easy,nonn,base,changed

AUTHOR

N. J. A. Sloane and Nadia Heninger, Aug 10 2005

EXTENSIONS

More terms from Jonathan Cross (jcross(AT)juggler.net), Oct 14 2005

STATUS

approved

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 August 30 05:55 EDT 2015. Contains 261200 sequences.