This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A123721 a(n) = A123249(n) - 2*n. 1
 1, 0, 0, 1, 0, 1, 0, 0, 2, 1, 0, 0, 2, 1, 0, 1, 0, 0, 0, 3, 2, 1, 0, 1, 0, 0, 0, 3, 2, 1, 0, 0, 2, 1, 0, 1, 0, 1, 0, 0, 0, 0, 4, 3, 2, 1, 0, 0, 2, 1, 0, 1, 0, 1, 0, 0, 0, 0, 4, 3, 2, 1, 0, 1, 0, 0, 0, 3, 2, 1, 0, 0, 2, 1, 0, 0, 2, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 5, 4, 3, 2, 1, 0, 1, 0, 0, 0, 3, 2, 1, 0, 0, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,9 COMMENTS Conjecture: For k > 1, the smallest n such that a(n) = k is A123720(k) = 2^k + 2^(k-1) - k. Confirmed for k <= 22. LINKS PROG (PARI) {m=105; w=vector(3*m); print1(a=1, ", "); for(n=2, m, k=n; while(w[k], k++); a=n+k; print1(a-2*n, ", "); w[a]=1)} CROSSREFS Cf. A123249, A123720. Sequence in context: A072575 A025872 A112344 * A085863 A220354 A054008 Adjacent sequences:  A123718 A123719 A123720 * A123722 A123723 A123724 KEYWORD nonn AUTHOR Klaus Brockhaus, Oct 09 2006 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .