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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A219653 Least inverse of A219652; a(n) = minimal i such that A219652(i) = n. 9
0, 1, 2, 4, 6, 8, 12, 16, 20, 24, 26, 30, 34, 38, 42, 48, 52, 56, 60, 66, 72, 78, 84, 90, 96, 102, 108, 116, 120, 122, 126, 130, 134, 138, 144, 148, 152, 156, 162, 168, 174, 180, 186, 192, 198, 204, 212, 218, 226, 234, 240, 244, 248, 252, 258, 264, 270, 276 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

A. Karttunen, Table of n, a(n) for n = 0..10080

PROG

(Scheme with Antti Karttunen's Intseq-library, three different variants):

(define A219653 (MATCHING-POS 0 0 (lambda (i) (or (< i 1) (not (= (A219652 (- i 1)) (A219652 i)))))))

(define A219653v2 (LEAST-I-WITH-FUN-I-EQ-N 0 0 A219652)) ;; Slow!

(define A219653v3 (RECORD-POS 0 0 A219652))

CROSSREFS

Cf. A219655 for the greatest inverse. A219654 gives the first differences.

This sequence is based on Factorial number system: A007623. Analogous sequence for binary system: A213708 and for Zeckendorf expansion: A219643. Cf. A219652, A219659, A219666.

Sequence in context: A322492 A317246 A279686 * A050622 A082662 A246663

Adjacent sequences:  A219650 A219651 A219652 * A219654 A219655 A219656

KEYWORD

nonn

AUTHOR

Antti Karttunen, Nov 25 2012

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 June 25 21:43 EDT 2019. Contains 324357 sequences. (Running on oeis4.)