id:A053314 - OEIS Search Results

Search: id:A053314

Displaying 1-1 of 1 results found.

page 1

a(n) contains n digits (either '1' or '4') and is divisible by 2^n.

+0
1

4, 44, 144, 4144, 14144, 414144, 1414144, 41414144, 441414144, 1441414144, 11441414144, 411441414144, 4411441414144, 44411441414144, 444411441414144, 1444411441414144, 41444411441414144, 441444411441414144 (list; graph; listen)

	OFFSET	`1,1`
	FORMULA	`a(n)=a(n-1)+10^(n-1)(4-3[a(n-1)/2^(n-1) mod 2]) i.e. a(n) ends with a(n-1); if (n-1)-th term is divisible by 2^n then n-th term begins with a 2, if not then n-th term begins with a 7.`
	CROSSREFS	`Cf. A023401, A050621, A050622, A035014.` `Sequence in context: A015084 A102388 A071125 this_sequence A051223 A077435 A074751` `Adjacent sequences: A053311 A053312 A053313 this_sequence A053315 A053316 A053317`
	KEYWORD	`base,nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Mar 06 2000`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research