cp's OEIS Frontend

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.

Showing 1-2 of 2 results.

A039673 Twin Fibonacci-lucky numbers.

Original entry on oeis.org

2, 4, 5, 7, 11, 13, 23, 25, 38, 40, 50, 52, 56, 58, 59, 61, 74, 76, 86, 88, 101, 103, 104, 106, 122, 124, 131, 133, 149, 151, 164, 166, 173, 175, 185, 187, 200, 202, 236, 238, 248, 250, 254, 256, 266, 268, 275, 277, 281, 283, 308, 310, 329, 331, 344, 346, 380
Offset: 1

Views

Author

Keywords

Comments

See A039672 for definition.

Crossrefs

Cf. A039672 - Lower terms: A039693, upper terms: A039694, middle terms: A039695.

Programs

  • Maple
    From R. J. Mathar, Oct 10 2010: (Start)
    A039672 := proc(nmax) L := [seq(i,i=1..nmax)] ; for itr from 1 do if itr+1 > nops(L) then return L; end if; str := op(itr,L)+op(itr+1,L) ; for i from floor(nops(L)/str) to 1 by -1 do L := subsop(str*i=NULL,L) ; end do: print(L) ; end do: end proc:
    L := A039672(600) ; for i from 1 to nops(L)-1 do if op(i,L) = op(i+1,L)-2 then printf("%d,%d,",op(i,L),op(i+1,L)) ; fi; end do: (End)

Extensions

Corrected from a(25) on by R. J. Mathar, Oct 10 2010

A039695 Twin Fibonacci-lucky numbers (middle terms).

Original entry on oeis.org

3, 6, 12, 24, 39, 51, 57, 60, 75, 87, 102, 105, 123, 132, 150, 165, 174, 186, 201, 237, 249, 255, 267, 276, 282, 309, 330, 345, 381, 393, 426, 444, 462, 480, 492, 519, 528, 546, 570, 618, 633, 660, 771, 780, 795, 804, 816, 876, 885, 903, 948, 966, 984, 1005
Offset: 1

Views

Author

Keywords

Comments

See A039672 for definition.

Crossrefs

Formula

a(n) = A039693(n)+1 = A039694(n)-1. [From R. J. Mathar, Oct 10 2010]

Extensions

Corrected by R. J. Mathar, Oct 10 2010
Showing 1-2 of 2 results.