editing

approved

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

approved

editing

_Howard A. Landman (howard(AT)polyamory.org), _, Sep 23 2001

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 (mathar(AT)strw.leidenuniv.nl), _, Jun 26 2007

More terms from _R. J. Mathar (mathar(AT)strw.leidenuniv.nl), _, Jun 26 2007

<a href="/Sindx_index/Per.html#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>

<a href="/Sindx_Per.html#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>

easy,nonn,new

<a href="http://www.research.att.com/~njas/sequences/Sindx_Per.html#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>

easy,nonn,new

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: - Richard R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 26 2007

easy,nonn,new

More terms from Richard R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 26 2007

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, 18, 66, 35, 17, 78, 44, 26, 91, 29, 105, 54, 34, 120, 25, 136, 65, 24, 153, 77, 43, 171, 23, 190, 90, 53, 210, 33, 231, 104, 37, 253, 119, 64, 276, 42, 300, 135, 32

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: - Richard J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 26 2007

easy,nonn,more,new

More terms from Richard J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 26 2007

easy,nonn,newmore