id:A075370 - OEIS Search Results

Search: id:A075370

Displaying 1-1 of 1 results found.

page 1

Smallest square-free number > 1 such that the every partial sum is square-free.

+0
3

2, 3, 2, 3, 3, 2, 2, 2, 2, 2, 3, 3, 2, 2, 2, 2, 2, 2, 2, 3, 5, 2, 2, 2, 2, 2, 5, 3, 2, 2, 5, 5, 2, 2, 2, 2, 2, 2, 2, 5, 3, 2, 2, 2, 2, 2, 3, 5, 6, 2, 2, 5, 3, 2, 2, 6, 3, 3, 2, 2, 2, 2, 2, 3, 3, 5, 3, 2, 2, 2, 3, 3, 2, 2, 2, 2, 2, 2, 5, 3, 2, 2, 2, 2, 2, 3, 3, 2, 2, 2, 2, 2, 2, 5, 3, 2, 2, 2, 2, 2, 3, 3, 2, 2, 2 (list; graph; listen)

	OFFSET	`0,1`
	COMMENT	`Subsidiary sequences that should be added: index of the first occurrence of the n-th square-free number; index of the first occurrence of strings of n 2's, or n 3's etc.`
	CROSSREFS	`Cf. A075371.` `Sequence in context: A075019 A138960 A115397 this_sequence A030350 A026240 A124474` `Adjacent sequences: A075367 A075368 A075369 this_sequence A075371 A075372 A075373`
	KEYWORD	`nonn`
	AUTHOR	`Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Sep 20 2002`
	EXTENSIONS	`More terms from David Wasserman (dwasserm(AT)earthlink.net), Jan 16 2005`

page 1

Search completed in 0.002 seconds

Last modified November 25 08:46 EST 2009. Contains 167481 sequences.

AT&T Labs Research