This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A085197 #15 Jul 09 2025 03:58:34
%S A085197 1,3,6,8,11,15,17,20,22,25,29,31,34,38,43,45,48,50,53,57,59,62,64,67,
%T A085197 71,73,76,80,85,87,90,92,95,99,101,104,108,113,115,118,122,127,133,
%U A085197 135,138,140,143,147,149,152,154,157,161,163,166,170,175,177,180,182,185,189
%N A085197 Positions of ones in A007001. Repeating part in each sub-permutation A082315[A014137(n-1)..A014138(n-1)] normalized to begin from 1.
%C A085197 From the second term 3 onward also one more than the partial sums of A076050.
%H A085197 Paolo Xausa, <a href="/A085197/b085197.txt">Table of n, a(n) for n = 1..16796</a>
%H A085197 Antti Karttunen, <a href="/A080237/a080237tree.txt">Notes concerning A080237-tree and related sequences.</a>
%F A085197 a(n) = A080336(n-1) + n = A082854(A082315(A072795(A081291(n-1)))).
%F A085197 a(n) = n if n < 2, otherwise a(n-1)+A076050(n-1).
%t A085197 PositionIndex[Nest[Flatten[Map[Range[#+1] &, #]] &, {1}, 6]][[1]] (* _Paolo Xausa_, Mar 04 2024 *)
%Y A085197 Cf. A085196. First column of A085180.
%K A085197 nonn
%O A085197 1,2
%A A085197 _Antti Karttunen_, Jun 14 2003. Proposed by _Wouter Meeussen_ Mar 15 2003