id:A058207 - OEIS Search Results

Search: id:A058207

Displaying 1-1 of 1 results found.

page 1

Three steps forward, two steps back.

+0
2

0, 1, 2, 3, 2, 1, 2, 3, 4, 3, 2, 3, 4, 5, 4, 3, 4, 5, 6, 5, 4, 5, 6, 7, 6, 5, 6, 7, 8, 7, 6, 7, 8, 9, 8, 7, 8, 9, 10, 9, 8, 9, 10, 11, 10, 9, 10, 11, 12, 11, 10, 11, 12, 13, 12, 11, 12, 13, 14, 13, 12, 13, 14, 15, 14, 13, 14, 15, 16, 15, 14, 15, 16, 17, 16, 15, 16, 17, 18, 17, 16, 17, 18 (list; graph; listen)

	OFFSET	`0,3`
	FORMULA	`a(n)=a(n-5)+1. a(n)=a(n-1) if n=1, 2 or 3 mod 5; a(n)=a(n-1)-1 if n=0 or 4 mod 5. G.f.: (x(1+x^2)(1+x)^2+x^3)/(1-x^5)^2.` `a(n)=n/5+4/5((n mod 5)mod 4)+6/5floor((n mod 5)/4) [From Rolf Pleisch (r_pleisch(AT)gmx.ch), Jul 26 2009]`
	PROGRAM	`(MAGMA) [ n le 4 select n-1 else n eq 5 select 2 else Self(n-5)+1: n in [1..83] ]; [From Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Apr 14 2009]`
	CROSSREFS	`Cf. A008611.` `Sequence in context: A152978 A118121 A006968 this_sequence A105969 A163530 A114409` `Adjacent sequences: A058204 A058205 A058206 this_sequence A058208 A058209 A058210`
	KEYWORD	`easy,nonn,nice`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Nov 29 2000`

page 1

Search completed in 0.002 seconds

Last modified December 2 11:54 EST 2009. Contains 167921 sequences.

AT&T Labs Research