id:A007807 - OEIS Search Results

Search: id:A007807

Displaying 1-1 of 1 results found.

page 1

A variation on Euclid: a(n)=g(n)-1, where g(0)=0, g(1)=1, g(n+1)=g(n)(g(n-1)+1).

+0
2

0, 0, 1, 3, 11, 59, 779, 47579, 37159979, 1768109008379, 65702897157329640779, 116169884340604934905464739377179, 7632697963609645128663145969343357330533515068777579 (list; graph; listen)

	OFFSET	`1,4`
	REFERENCES	`M. E. Mays, Iterating the division algorithm, Fib. Quart., 25 (1987), 204-213.`
	CROSSREFS	`Cf. A005831.` `Sequence in context: A137982 A074509 A112368 this_sequence A075201 A136440 A007146` `Adjacent sequences: A007804 A007805 A007806 this_sequence A007808 A007809 A007810`
	KEYWORD	`nonn`
	AUTHOR	`mays(AT)math.wvu.edu (Mike Mays)`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research