id:A087849 - OEIS Search Results

Search: id:A087849

Displaying 1-1 of 1 results found.

page 1

a(n)=a(a(a(n-1))) + abs(2*a(n-1)-n).

+0
1

1, 1, 2, 1, 4, 3, 2, 5, 2, 7, 4, 5, 4, 7, 2, 13, 10, 4, 12, 8, 9, 5, 14, 6, 15, 5, 18, 9, 12, 10, 13, 7, 20, 11, 14, 10, 19, 5, 30, 27, 17, 15, 14, 18, 10, 28, 11, 27, 9, 33, 23, 13, 28, 4, 48, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`A triply-recursive sequence.`
	PROGRAM	`(TRUE BASIC) 60 REM BATRACHION SEQUENCE 70 DIM q0(0 to 4000) 80 LET q0(1)=1 90 LET q0(2)=1 91 FOR n = 3 to 3999 92 LET q0(n)=q0(q0(q0(n-1)))+Abs(2*q0(n-1)-n) 93 NEXT n 100 SET MODE "color" 110 SET WINDOW 0, 1024, 0, 750 301 PRINT" triple sequence" 302 PRINT" by Roger L. Bagula Oct 07 2003 " 381 OPEN #1: name "CM1:triple_data", create newold, org text 390 FOR x=1 to 200 391 PRINT #1: q0(x); ", "; 392 PRINT q0(x); 393 NEXT x 394 CLOSE #1 460 END`
	CROSSREFS	`Sequence in context: A104895 A103122 A087850 this_sequence A075015 A082494 A110663` `Adjacent sequences: A087846 A087847 A087848 this_sequence A087850 A087851 A087852`
	KEYWORD	`nonn`
	AUTHOR	`Roger L Bagula (rlbagulatftn(AT)yahoo.com), Oct 08 2003`

page 1

Search completed in 0.002 seconds

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research