login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A219922 Smallest m such that n is contained in m-th row of A026835. 2
1, 3, 5, 6, 7, 8, 11, 9, 15, 10, 19, 11, 23, 29, 12, 27, 16, 13, 37, 20, 17, 14, 24, 21, 18, 28, 15, 22, 19, 29, 26, 16, 36, 33, 20, 27, 37, 17, 31, 44, 21, 38, 35, 25, 32, 18, 29, 22, 36, 46, 26, 56, 40, 19, 30, 23, 44, 34, 27, 51, 64, 31, 58, 20, 97, 24 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

A026835(a(n),k) = n for some k.

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..180

PROG

(Haskell)

import Data.List (findIndex)

import Data.Maybe (fromJust)

a219922 n = (fromJust $ findIndex (n `elem`) a026835_tabl) + 1

CROSSREFS

Sequence in context: A076054 A253201 A139636 * A159559 A047583 A010906

Adjacent sequences:  A219919 A219920 A219921 * A219923 A219924 A219925

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Dec 01 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 January 29 01:49 EST 2020. Contains 331328 sequences. (Running on oeis4.)