login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070881 Least k such that A070868(k) = n. 1

%I #2 Mar 30 2012 17:30:44

%S 1,3,6,8,13,15,19,26,28,32,34,47,49,53,57,59,73,80,82,88,92,104,109,

%T 123,125,127,135,139,143,147,168,193,182,184,188,194,196,204,208,214,

%U 257,250,259,261,263,269,277,275,287,309,305,313,315,352,366,375,362

%N Least k such that A070868(k) = n.

%t 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

%Y Cf. A070868.

%K easy,nonn

%O 1,2

%A _Robert G. Wilson v_, May 20 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 18:17 EDT 2024. Contains 371962 sequences. (Running on oeis4.)