|
| |
|
|
A109733
|
|
Sequence (written here in base 10) is its own 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
|
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
|
a(1) = 53 (decimal) = 65 (octal) => '5',
a(2) = 51 (decimal) = 63 (octal) => '3',
a(3) = 53 (decimal) = 65 (octal) => '5',
a(4) = 49 (decimal) = 61 (octal) => '1', etc.
|
|
|
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
|
Cf. A109648.
Sequence in context: A171132 A104936 A109648 * A094462 A042403 A217609
Adjacent sequences: A109730 A109731 A109732 * A109734 A109735 A109736
|
|
|
KEYWORD
|
easy,nonn,base
|
|
|
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
|
| |
|
|
