Reminder that I only recieved one entry. And it's mine.

Welcome to this week's Code Golf: The Reboot, the fourth incarnation of the challenge hosted by myself, Juju. Not @pimathbrainiac, @c4ooo nor @JWinslow23, the one and only @Juju. I have a situation for you tonight. Let's say you have a car. Unfortunately, you left your set of keys on the seat, and the car is locked. "Oh no, I locked my keith inside", you say, with a strong lisp. However, your car came with a numerical lock, five (5) keys numbered from 1 to 5 that can replace your keys if needed, no need to call the AAA, OnStar or whatever it's called in your country. The car is rather new and you didn't had time to check the manual for the default code and how to set it, but you know the code is four (4) numbers long and the lock checks after every keypress, as in, if you enter successively 1-2-3-4-5-1, it checks against the codes 1234, 2345 and 3451. You don't really have the time to try every combination one after the other, but you know of a sequence that will check against every code successively in a minimal number of keypresses, the de Bruijn sequence, as it's called. You have your calc/smartphone/laptop on you, as you've been taught to carry no less than 5 computers on you at all times, like a sensible person, so you write a little program to compute such a sequence and try it out.

Here's a sample output:
11112111311141115112211231124112511321133113411351142114311441145115211531154115
51212131214121512221223122412251232123312341235124212431244124512521253125412551
31314131513221323132413251332133313341335134213431344134513521353135413551414151
42214231424142514321433143414351442144314441445145214531454145515152215231524152
51532153315341535154215431544154515521553155415552222322242225223322342235224322
44224522532254225523232423252333233423352343234423452353235423552424252433243424
35244324442445245324542455252533253425352543254425452553255425553333433353344334
53354335534343534443445345434553535443545355435554444544554545555
The cyclic sequence (as in, it wraps around so at the end it's really ...4555511112...) should contain every 4-number sub-sequence as described above exactly once per cycle. Your output don't have to be exactly this, as in there's many, many sequences with the above properties, but it should have the same length. Also, no newlines other than where it should wrap around on the screen (I've put some here because it would mess up this post, don't do that at home). Your challenge is, of course, write the smallest program that generates such sequence. If the sequence don't fit it all on the screen, like on calcs, you can implement a pager (like less on UNIX systems) or output a string that can be scrolled, or anything that could work, be sure to ask me if you're not sure and tell instructions if it's not immediately obvious or requires user action.

All the usual rules applies, like no loopholes. All non-calc languages will be scored with this counter I wrote for your convenience. Assembly and compiled Axe programs will be scored on binary size (minus the header), and TI-BASIC will be scored on on-calc source size (again, minus the header). PM me with your submission on Omnimaga and/or CodeWalrus, on every private messaging system you know you can reach me or if you know where I live or know me IRL, bring me a 3.5" floppy disk with the source enclosed. (Seriously, that would be epic and would definitely allow you a bonus.) I'll also count out the number of keypresses it took you to get to a particular code I won't disclose until the end, but it's just for fun And if you wanna get involved, I suggest you to check this thread.

Good luck and have fun! You have until next Sunday, 11:59:59 PM EDT.

Next week with @JWinslow23, you found your keys, but you can't figure out which one it is...

Scores
 
Language Ranking

Rank	Lang	User	Size	Date	Code
1	Ruby	@Juju	163	2015/06/22 15:29:00	Spoiler For Spoiler:

[/spoiler]



Ruby

Rank	User	Size	Date
1	Juju	163	2015/06/22 15:29:00

Unfortunately, no one submitted any entry, no one got the key... And I win by default, apparently. I'll post my code soon, and you still can submit an entry at a later date.

Hey there, nice to see you again!

Your game looks promising, I'm looking for a job or some contracts, so if I can help in any way that would be pretty nice. I don't have much experience on Android (although I did some), and none at all on iDevices, I'm more PC. Also if you want a promo website done, I'm your man. I'm starting to do some for a living.

It's kinda easy.

On GitHub's side, keep the CNAME file. On dotTK's side, there should be somewhere you can set DNS records up instead of simply forwarding to somewhere else. Use Dot TK DNS Service and give it one (or both, if you can) of those IP addresses:

192.30.252.153
192.30.252.154

Now it should work.

Hm, another graphic challenge. Gotta try the new PICO-8 0.1.1 out.

I already wrote my announcement for my code golf, gotta be interesting. Gotta post it when it's my turn.

Yeah, BTNP still returns true every 4 frames, which is not what we want.

EDIT: 153 bytes! Which is the same score you got, but with the 1 pixel of movement per press thing xD

EDIT: 149! I forgot to remove one useless declaration. That's pretty crazy.

Well, it's not like we've never necro'd topics before... xD I like the post-mortem topic idea, though.