login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A269317 Ternary version of A257341: take the proper fractions in lowest terms in ascending order by denominators and within each denominator in ascending order by numerators. a(n) is the n-th ternary digit of the n-th fraction. 0
1, 0, 0, 2, 2, 1, 1, 0, 2, 1, 1, 2, 0, 0, 0, 0, 1, 1, 1, 2, 2, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 1, 0, 2, 0, 2, 2, 0, 0, 1, 0, 0, 0, 0, 1, 2, 0, 2, 1, 0, 2, 1, 2, 1, 1, 1, 2, 2, 2, 0, 1, 1, 1, 1, 2, 0, 2, 2, 0, 2, 1, 1, 1, 0, 1, 0, 2, 1, 0 (list; constant; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

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

MATHEMATICA

FractionList[n_] := Module[

{i, j, A},

A = Union[Flatten[Table[j/i, {i, 1, n}, {j, 1, i}]]];

Sort[A,

Denominator[#1] <

Denominator[#2] || (Denominator[#1] ==

Denominator[#2] && #1 < #2) &]

];

DiagDigits[n_, b_] := Module[

{A, B, d},

A = Drop[FractionList[n], 1];

d = Table[RealDigits[A[[i]], b, n, -1][[1, i]], {i, 1, n}]

];

DiagDigits[86, 3]

CROSSREFS

Cf. A257341, A020652, A038567.

Sequence in context: A281492 A112183 A275451 * A119557 A125919 A241079

Adjacent sequences:  A269314 A269315 A269316 * A269318 A269319 A269320

KEYWORD

nonn,cons

AUTHOR

Peter Karpov, Feb 23 2016

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 6 23:56 EDT 2020. Contains 335484 sequences. (Running on oeis4.)