This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A064274 #11 Aug 04 2015 23:42:08
%S A064274 0,1,2,4,3,7,6,5,11,10,9,8,15,16,21,14,13,28,12,36,20,22,45,27,19,55,
%T A064274 18,66,35,17,78,44,26,91,29,105,54,34,120,25,136,65,24,153,77,43,171,
%U A064274 23,190,90,53,210,33,231,104,37,253,119,64,276,42,300,135,32
%N A064274 Inverse of sequence A035513 considered as a permutation of the nonnegative integers.
%H A064274 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%p A064274 Digits := 30 : A035513 := proc(n,k) local tau ; tau := (sqrt(5)+1)/2 ; combinat[fibonacci](k+1)*floor(n*tau)+(n-1)*combinat[fibonacci](k) ; end: A035513flat := proc(N) local r,c,k,np,n ; n := 1 : k := 1 : for np from 2 to N do n := n+1 : k := k-1 : if k = 0 then k := n: n := 1: fi ; od ; A035513(n,k) ; end: a035513 := [] : a := -1 : nmax := 300 : for n from 1 to nmax do a035513 := [op(a035513),A035513flat(n)] : od : printf("0, ") ; n := 1: while true do if member(n,a035513,'a') then printf("%d, ",a) ; else break ; fi ; n := n+1 : od: # _R. J. Mathar_, Jun 26 2007
%Y A064274 Cf. A035513.
%K A064274 easy,nonn
%O A064274 0,3
%A A064274 _Howard A. Landman_, Sep 23 2001
%E A064274 More terms from _R. J. Mathar_, Jun 26 2007