Search: id:A071797
Results 1-1 of 1 results found.

%I A071797
%S A071797 1,1,2,3,1,2,3,4,5,1,2,3,4,5,6,7,1,2,3,4,5,6,7,8,9,1,2,3,4,5,6,7,8,9,10,
%T A071797 11,1,2,3,4,5,6,7,8,9,10,11,12,13,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,
               1,
%U A071797 2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,1,2,3,4,5,6,7,8,9,10,11
%N A071797 Restart counting after each new odd integer (a fractal sequence).
%C A071797 The following sequences all have the same parity: A004737, A006590, A027052, 
               A071028, A071797, A078358, A078446.
%D A071797 C. Kimberling : "Numeration systems and fractal sequences", Acta Arithmetica 
               73 (1995) 103-117.
%H A071797 F. Smarandache, <a href="http://www.gallup.unm.edu/~smarandache/OPNS.pdf">
               Only Problems, Not Solutions!</a>, Phoenix,AZ: Xiquan,1993.
%H A071797 M. Somos, <a href="a073189.txt">Sequences used for indexing triangular 
               or square arrays</a>
%F A071797 a(n) = n-1-ceiling(sqrt(n))*(ceiling(sqrt(n))-2); n>0.
%F A071797 a(n) = n-floor(sqrt(n-1))^2. - Marc LeBrun (mlb(AT)well.com), Jan 14 
               2004
%e A071797 a(1)=1; a(9)= 5; a(10)=1;
%o A071797 (PARI) a(n)=if(n<1,0,n-sqrtint(n-1)^2)
%Y A071797 Cf. A002260. a(n)=1+A053186(n-1).
%Y A071797 Sequence in context: A053737 A033924 A003315 this_sequence A025481 A124171 
               A076645
%Y A071797 Adjacent sequences: A071794 A071795 A071796 this_sequence A071798 A071799 
               A071800
%K A071797 easy,nonn
%O A071797 1,3
%A A071797 Antonio Esposito (antonio.b.esposito(AT)italtel.it), Jun 06 2002

Search completed in 0.002 seconds