A197877 Smallest number m such that A096535(m) = n.

2, 0, 5, 6, 465, 7, 16, 208, 37, 17, 11, 58, 40, 35, 84, 18, 45, 29, 395, 30, 68, 59, 41, 62, 32, 191, 325, 109, 369, 33, 89, 72, 36, 85, 42, 47, 64, 51, 101, 88, 77, 49, 125, 394, 1124, 249, 76, 50, 54, 65, 119, 74, 2193, 61, 483, 133, 80, 186, 95, 990, 468

Offset: 0

Author

Reinhard Zumkeller, Oct 19 2011

Keywords

• nonn

Comments

A096535(a(n)) = n and A096535(m) <> n for m < a(n), concerning first conjecture in A096535.

Examples

			a(0) = A096274(1) = 2; a(1) = A132678(1) = 0.
		

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 0..9999

Programs

Haskell

import Data.List (elemIndex)
import Data.Maybe (fromJust)
a197877 n = a197877_list !! n
a197877_list = map (fromJust . (`elemIndex` a096535_list)) [0..]