id:A083239 - OEIS Search Results

Search: id:A083239

Displaying 1-1 of 1 results found.

page 1

First order recursion: a[0]=1; a(n)=phi[n]-a(n-1)=A000010[n]-a(n-1).

+0
1

0, 1, 1, 1, 3, -1, 7, -3, 9, -5, 15, -11, 23, -17, 25, -17, 33, -27, 45, -37, 49, -39, 61, -53, 73, -61, 79, -67, 95, -87, 117, -101, 121, -105, 129, -117, 153, -135, 159, -143, 183, -171, 213, -193, 217, -195, 241, -225, 267, -247, 279, -255, 307, -289, 329, -305, 341, -313, 371, -355, 415, -385, 421, -389, 437, -417 (list; graph; listen)

	OFFSET	`1,5`
	COMMENT	`Provide interesting decomposition: phi(n)=u+w, where u and w consecutive terms of this sequence; Depends also on initial value.`
	EXAMPLE	`It follows that a(n)+a(n-1)=A000010(n)`
	MATHEMATICA	`f[x_] := EulerPhi[x]-f[x-1] f[0]=1; Table[f[w], {w, 1, 100}]`
	CROSSREFS	`Cf. A000213, A083236, A083237, A083238, A000010.` `Sequence in context: A161942 A053092 A115873 this_sequence A095868 A140962 A013602` `Adjacent sequences: A083236 A083237 A083238 this_sequence A083240 A083241 A083242`
	KEYWORD	`sign`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Apr 23 2003`

page 1

Search completed in 0.002 seconds

Last modified November 24 19:42 EST 2009. Contains 167435 sequences.

AT&T Labs Research