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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A219655 Greatest inverse of A219652; a(n) = maximal i such that A219652(i) = n. 10
0, 1, 3, 5, 7, 11, 15, 19, 23, 25, 29, 33, 37, 41, 47, 51, 55, 59, 65, 71, 77, 83, 89, 95, 101, 107, 115, 119, 121, 125, 129, 133, 137, 143, 147, 151, 155, 161, 167, 173, 179, 185, 191, 197, 203, 211, 217, 225, 233, 239, 243, 247, 251, 257, 263, 269, 275, 281 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

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

FORMULA

a(n) = A219653(n) + A219654(n) - 1.

PROG

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

(define A219655 (PARTIALSUMS 1 0 (compose-funs A219654 1+)))

(define A219655v2 (compose-funs -1+ (LEAST-I-WITH-FUN-I-EQ-N 0 0 A219652) 1+)) ;; Slow!

(define (A219655v3 n) (+ (A219653 n) (A219654 n) -1))

CROSSREFS

Cf. A219653 for the least inverse. A219654 gives the first differences.

This sequence is based on factorial number system: A007623. Analogous sequence for binary system: A173601, for Zeckendorf expansion: A219645.

Sequence in context: A238738 A059748 A122124 * A007665 A208994 A194602

Adjacent sequences:  A219652 A219653 A219654 * A219656 A219657 A219658

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 12:01 EDT 2019. Contains 324352 sequences. (Running on oeis4.)