id:A157696 - OEIS Search Results

Search: id:A157696

Displaying 1-1 of 1 results found.

page 1

Define k(n) to be the sequence of integers such that k(n)F(n)=F(2n)(Fibonacci sequence) (A000204); in turn define g(n) to be the sequence of integers such that g(n)k(n)=k(3n)(A110391); finally a(n) is the sequence of integers such that a(n)g(n)=g(5n).

+0
2

124, 2521, 97921, 4974489, 226965751, 10783342081, 504420084871, 23735900452321, 1114384154071676 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`Indices 2 of F(i), 3 of k(i) and 5 of g(i) are the minimum integers that provide sequences of integers.`
	CROSSREFS	`A000204, A110391, A000045` `Sequence in context: A038645 A038859 A024017 this_sequence A035816 A097842 A146516` `Adjacent sequences: A157693 A157694 A157695 this_sequence A157697 A157698 A157699`
	KEYWORD	`nonn`
	AUTHOR	`Carmine Suriano (surianonoi5(AT)libero.it), Mar 04 2009`

page 1

Search completed in 0.002 seconds

Last modified December 6 13:45 EST 2009. Contains 170429 sequences.

AT&T Labs Research