Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A085263
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A085263
%S A085263 0,1,1,1,1,2,2,1,1,2,3,2,0,3,3,2,2,3,3,2,2,3,4,2,1,4,4,2,1,5,4,3,2,2,5,
%T A085263 2,3,6,6,3,2,6,4,3,2,5,6,3,2,5,6,3,2,4,6,4,3,4,6,4,1,7,5,3,3,7,6,4,4,6,
%U A085263 8,3,3,6,7,2,4,8,5,4,3,7,9,4,2,8,9,4,3,6,6,5,4,7,9,5,3,8,4,3,5,9
%N A085263 Number of ways to write n as sum of a squarefree number and a square.
%C A085263 a(A085265(n))>0; a(A085266(n))=1; a(A085267(n))>1.
%C A085263 a(A085264(n))=n and a(i)<>n for i<A085264(n).
%H A085263 T. D. Noe, <a href="b085263.txt">Table of n, a(n) for n = 1..10000</a>
%H A085263 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               SquareNumber.html">Square Numbers.</a>
%H A085263 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               Squarefree.html">Squarefree</a>
%F A085263 a(n+1) = SUM(A008966(k)*A010052(n-k+1): 1<=k<=n). [From Reinhard Zumkeller 
               (reinhard.zumkeller(AT)gmail.com), Nov 04 2009]
%e A085263 a(11)=3: 11 = 1+10=A000290(1)+A005117(7) =
%e A085263 4+7=A000290(2)+A005117(6) = 9+2=A000290(3)+A005117(2).
%Y A085263 Sequence in context: A030298 A098281 A103343 this_sequence A115092 A011847 
               A091325
%Y A085263 Adjacent sequences: A085260 A085261 A085262 this_sequence A085264 A085265 
               A085266
%K A085263 nonn
%O A085263 1,6
%A A085263 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 23 2003

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research