A133497 - OEIS

This site is supported by donations to The OEIS Foundation.

A133497

a(n) = n-th number such that b(n)-b(n-1) = 2 where b(p) = floor (sum(i,1,p}(i^(1/i))).

4, 7, 10, 14, 20, 27, 35, 45, 58, 73, 91, 113, 138, 168, 203, 244, 291, 345, 408, 481, 563, 658, 766, 888, 1027 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,1`
	EXAMPLE	`b(1) = 1, b(2) = 2, b(3) = 3 b(4) = 5, hence b(4)-b(3) = 2 and a(1) = 4`
	PROG	`(PARI) (A=0); for(p=1, 1000, B=A; A=B+p^(1/p); if(floor(A)-floor(B)-1; print(p)))`
	CROSSREFS	`Sequence in context: A184625 A184118 A161187 * A187334 A064368 A026372` `Adjacent sequences: A133494 A133495 A133496 * A133498 A133499 A133500`
	KEYWORD	`easy,nonn`
	AUTHOR	`Philippe Lallouet (philip.lallouet(AT)orange.fr), Dec 01 2007`

Content is available under The OEIS End-User License Agreement .

Last modified February 14 13:08 EST 2012. Contains 205623 sequences.