The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A253603

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A253603

Smallest number m such that A253581(m) = n.
(history; published version)

#6 by Max Alekseyev at Sat Jan 17 12:23:23 EST 2015

STATUS

editing

approved

#5 by Max Alekseyev at Sat Jan 17 12:23:20 EST 2015

COMMENTS

A253881A253581(a(n)) = n; conjecture: the sequence is defined for all n.

STATUS

approved

editing

#4 by Reinhard Zumkeller at Tue Jan 13 07:33:08 EST 2015

STATUS

editing

approved

#3 by Reinhard Zumkeller at Mon Jan 12 17:06:46 EST 2015

COMMENTS

A253881(a(n)) = n; conjecture: the sequence is defined for all n.

PROG

(Haskell)

import Data.List (elemIndex); import Data.Maybe (fromJust)

a253603 = fromJust . (`elemIndex` a253581_list)

CROSSREFS

Cf. A253581, A252867.

#2 by Reinhard Zumkeller at Mon Jan 12 17:04:13 EST 2015

NAME

allocated for Reinhard ZumkellerSmallest number m such that A253581(m) = n.

DATA

0, 1, 2, 18, 3, 70, 39, 75, 10, 193, 16, 85, 124, 23, 51, 200, 20, 79, 41, 303, 28, 102, 98, 1105, 71, 115, 73, 301, 543, 152, 325, 344, 15, 64, 27, 125, 47, 66, 170, 179, 306, 93, 289, 1174, 49, 376, 1195, 440, 45, 566, 312, 1170, 104, 2133, 108, 468, 162

OFFSET

0,3

LINKS

Reinhard Zumkeller, <a href="/A253603/b253603.txt">Table of n, a(n) for n = 0..1000</a>

KEYWORD

allocated

nonn

AUTHOR

Reinhard Zumkeller, Jan 12 2015

STATUS

approved

editing

#1 by Reinhard Zumkeller at Mon Jan 05 12:21:57 EST 2015

NAME

allocated for Reinhard Zumkeller

KEYWORD

allocated

STATUS

approved