Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098236
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098236 Number of ways to write n as sum of two positive distinct squarefree numbers. +0
2
0, 0, 1, 1, 1, 1, 2, 3, 2, 1, 2, 3, 3, 2, 3, 5, 4, 4, 3, 5, 4, 4, 4, 7, 5, 4, 5, 6, 5, 4, 5, 8, 6, 6, 6, 11, 7, 6, 7, 11, 8, 7, 9, 12, 10, 7, 8, 13, 10, 8, 7, 13, 10, 10, 7, 13, 10, 10, 9, 14, 11, 10, 11, 15, 11, 10, 11, 17, 12, 12, 11, 21, 13, 13, 13, 19, 14, 12, 14, 20, 16, 12, 13, 21 (list; graph; listen)
OFFSET

1,7

CROSSREFS

Cf. A005117, A098235.

Sequence in context: A032452 A084199 A030314 this_sequence A152978 A118121 A006968

Adjacent sequences: A098233 A098234 A098235 this_sequence A098237 A098238 A098239

KEYWORD

nonn

AUTHOR

Ralf Stephan, Aug 31 2004

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 19 21:04 EST 2009. Contains 171054 sequences.


AT&T Labs Research