This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A070882 Least k such that A070867(k) = n, or 0 if no such k exist. 0
 1, 3, 7, 6, 12, 16, 0, 11, 21, 23, 20, 18, 24, 0, 33, 25, 36, 37, 38, 28, 34, 40, 31, 47, 81, 44, 0, 45, 0, 57, 62, 66, 48, 61, 84, 52, 0, 67, 55, 69, 85, 97, 63, 76, 103, 109, 131, 79, 87, 118, 0, 86, 95, 139, 102, 80, 107, 113, 0, 91, 101, 133, 183, 134, 158, 104, 0, 141 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(n) = 0 for n = 7, 14, 27, 29, 37, 51, 59, 67, 88, 90, 97, 103, 106, 140, 156, 157, 158, 167, 174, 175, 177, 179, 193, 195, 199, 201, 207, 211, 215, 235, 241, 245, 250, 252, 258, 277, 282, 291, 294, 298, 300, 302, 305, 306, 317, 323, 327, 328, 329, 343, 346, 348, ... LINKS MATHEMATICA a[1] = a[2] = 1; a[n_] := a[n] = a[n - 1 - a[n - 1]] + a[n - 1 - a[n - 2]]; = Table[0, {100}]; Do[c = a[n]; If[c < 101 && b[[c]] == 0, b[[c]] = n], {n, 1, 10^3}]; b CROSSREFS Cf. A070867. Sequence in context: A296343 A117823 A178242 * A109635 A095360 A175142 Adjacent sequences:  A070879 A070880 A070881 * A070883 A070884 A070885 KEYWORD easy,nonn AUTHOR Robert G. Wilson v, May 20 2002 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.

Last modified January 20 17:05 EST 2019. Contains 319335 sequences. (Running on oeis4.)