id:A079633 - OEIS Search Results

Search: id:A079633

Displaying 1-1 of 1 results found.

page 1

a(n)=floor(n/floor(n^(1/3)))-floor(n^(2/3)).

+0
1

0, 1, 1, 2, 3, 3, 4, 0, 0, 1, 1, 1, 1, 2, 1, 2, 2, 3, 2, 3, 3, 4, 3, 4, 4, 5, 0, 0, 0, 1, 1, 0, 1, 1, 1, 2, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 2, 3, 3, 3, 4, 4, 3, 4, 4, 4, 5, 5, 4, 5, 5, 5, 6, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 2, 1, 2, 2, 2, 2, 3, 3, 2, 2, 3, 3, 3, 3, 4, 3, 3, 3, 4, 4, 4, 4, 4, 4 (list; graph; listen)

	OFFSET	`1,4`
	FORMULA	`for n>4 : Max (a(k) : 1<=k<=n ) =ceil(n^(1/3)) + 2 if n is a cube or a cube minus 1; Max (a(k) : 1<=k<=n ) =ceil(n^(1/3)) + 1 otherwise`
	PROGRAM	`(PARI) a(n)=floor(n/floor(n^(1/3)+10^-20))-floor(n^(2/3)+10^-20)`
	CROSSREFS	`Sequence in context: A096393 A010120 A012887 this_sequence A060573 A103893 A106448` `Adjacent sequences: A079630 A079631 A079632 this_sequence A079634 A079635 A079636`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 30 2003`

page 1

Search completed in 0.002 seconds

Last modified December 9 18:50 EST 2009. Contains 170568 sequences.

AT&T Labs Research