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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109736 Where n appears in A109890. 2
1, 2, 3, 5, 9, 4, 23, 6, 8, 10, 40, 7, 22, 30, 11, 15, 67, 19, 49, 13, 38, 42, 43, 14, 12, 56, 21, 46, 48, 18, 58, 16, 41, 68, 37, 20, 89, 57, 60, 55, 76, 63, 151, 78, 107, 96, 98, 17, 61, 65, 69, 71, 24, 103, 87, 64, 80, 74, 44, 83, 59, 92, 101, 94, 72, 91, 185, 142, 104, 45 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

a(10^n): 1, 10, 128, 1430, ... - Robert G. Wilson v, Aug 12 2005

a(n) = A094341(n) for 3 <= n <= 70. - Georg Fischer, Nov 02 2018

LINKS

Richard J. Mathar and Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 (first 282 terms from Richard J. Mathar)

MATHEMATICA

a[1] = 1; a[2] = 2; a[n_] := a[n] = Block[{t = Table[a[i], {i, n - 1}]}, s = Plus @@ t; d = Divisors[s]; l = Complement[d, t]; If[l != {}, k = First[l], k = s; While[Position[t, k] == {}, k += s]; k]]; t = Table[a[n], {n, 250}]; Table[k = 1; While[ t[[k]] != n, k++ ]; k, {n, 70}] (* Robert G. Wilson v, Aug 12 2005 *)

PROG

(Haskell)

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

a109736 = (+ 1) . fromJust . (`elemIndex` a109890_list)

-- Reinhard Zumkeller, Jan 01 2015

CROSSREFS

Cf. A094341, A095259.

Sequence in context: A271525 A232562 A064358 * A119628 A021093 A011026

Adjacent sequences:  A109733 A109734 A109735 * A109737 A109738 A109739

KEYWORD

nonn

AUTHOR

N. J. A. Sloane and Nadia Heninger, Aug 11 2005

EXTENSIONS

More terms from Robert G. Wilson v, Aug 12 2005

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 July 21 04:40 EDT 2019. Contains 325189 sequences. (Running on oeis4.)