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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A255068 a(n) = the largest k such that A255070(k) = n. 8
2, 5, 6, 10, 11, 13, 14, 18, 21, 22, 23, 26, 27, 29, 30, 34, 37, 38, 42, 43, 45, 46, 47, 50, 53, 54, 55, 58, 59, 61, 62, 66, 69, 70, 74, 75, 77, 78, 82, 85, 86, 87, 90, 91, 93, 94, 95, 98, 101, 102, 106, 107, 109, 110, 111, 114, 117, 118, 119, 122, 123, 125, 126, 130, 133, 134, 138, 139, 141, 142, 146, 149, 150 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Antti Karttunen, Table of n, a(n) for n = 0..8192

FORMULA

a(n) = A091067(n+1) - 1.

PROG

(Scheme) (define (A255068 n) (- (A091067 (+ n 1)) 1))

CROSSREFS

First differences are A106836 (from its second term onward).

Cf. A091067, A255070, A255327.

Sequence in context: A109150 A004202 A013647 * A183987 A187840 A187904

Adjacent sequences:  A255065 A255066 A255067 * A255069 A255070 A255071

KEYWORD

nonn

AUTHOR

Antti Karttunen, Feb 21 2015

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 May 23 03:04 EDT 2019. Contains 323507 sequences. (Running on oeis4.)