This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A070881 Least k such that A070868(k) = n. 0
 1, 3, 6, 8, 13, 15, 19, 26, 28, 32, 34, 47, 49, 53, 57, 59, 73, 80, 82, 88, 92, 104, 109, 123, 125, 127, 135, 139, 143, 147, 168, 193, 182, 184, 188, 194, 196, 204, 208, 214, 257, 250, 259, 261, 263, 269, 277, 275, 287, 309, 305, 313, 315, 352, 366, 375, 362 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS MATHEMATICA a[1] = a[2] = 1; a[n_] := a[n] = a[a[n - 1]] + a[n + 1 - 2*a[n - 1]]; b = Table[0, {100}]; Do[c = a[n]; If[c < 101 && b[[c]] == 0, b[[c]] = n], {n, 1, 10^3}]; b CROSSREFS Cf. A070868. Sequence in context: A072107 A084578 A190493 * A046669 A046670 A131383 Adjacent sequences:  A070878 A070879 A070880 * A070882 A070883 A070884 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.